/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/POPL2023/work-steal1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:21:49,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:21:49,741 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:21:49,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:21:49,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:21:49,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:21:49,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:21:49,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:21:49,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:21:49,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:21:49,760 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:21:49,760 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:21:49,760 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:21:49,760 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:21:49,760 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:21:49,762 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:21:49,762 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:21:49,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:21:49,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:21:49,762 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:21:49,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:21:49,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:21:49,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:21:49,763 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:21:49,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:21:49,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:21:49,763 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:21:49,763 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:21:49,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:21:49,763 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:21:49,764 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:21:49,764 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:21:49,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:21:49,764 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:21:49,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:21:49,764 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:21:49,764 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:21:49,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:21:49,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:21:49,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:21:49,997 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:21:49,997 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:21:49,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/work-steal1.bpl [2025-04-26 16:21:49,998 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/work-steal1.bpl' [2025-04-26 16:21:50,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:21:50,019 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:21:50,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:50,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:21:50,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:21:50,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "work-steal1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "work-steal1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,062 INFO L138 Inliner]: procedures = 4, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 22 [2025-04-26 16:21:50,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:50,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:21:50,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:21:50,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:21:50,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "work-steal1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "work-steal1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "work-steal1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "work-steal1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,070 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "work-steal1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "work-steal1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "work-steal1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "work-steal1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "work-steal1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:21:50,079 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:21:50,079 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:21:50,079 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:21:50,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "work-steal1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:50,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:50,104 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:21:50,109 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:21:50,126 INFO L124 BoogieDeclarations]: Specification and implementation of procedure workerWithAssert given in one single declaration [2025-04-26 16:21:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure workerWithAssert [2025-04-26 16:21:50,127 INFO L138 BoogieDeclarations]: Found implementation of procedure workerWithAssert [2025-04-26 16:21:50,127 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:21:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:21:50,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:21:50,127 INFO L124 BoogieDeclarations]: Specification and implementation of procedure worker given in one single declaration [2025-04-26 16:21:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-04-26 16:21:50,127 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-04-26 16:21:50,128 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:21:50,165 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:21:50,166 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:21:50,285 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:21:50,285 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:21:50,339 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:21:50,339 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-26 16:21:50,340 INFO L201 PluginConnector]: Adding new model work-steal1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:50 BoogieIcfgContainer [2025-04-26 16:21:50,340 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:21:50,341 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:21:50,341 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:21:50,349 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:21:50,350 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:50,350 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "work-steal1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/2) ... [2025-04-26 16:21:50,351 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4743e0ce and model type work-steal1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:21:50, skipping insertion in model container [2025-04-26 16:21:50,351 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:50,351 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "work-steal1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:50" (2/2) ... [2025-04-26 16:21:50,352 INFO L376 chiAutomizerObserver]: Analyzing ICFG work-steal1.bpl [2025-04-26 16:21:50,404 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:21:50,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 32 transitions, 72 flow [2025-04-26 16:21:50,453 INFO L116 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-04-26 16:21:50,456 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-26 16:21:50,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 4/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 47 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-26 16:21:50,462 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 32 transitions, 72 flow [2025-04-26 16:21:50,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 62 flow [2025-04-26 16:21:50,467 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 31 places, 28 transitions, 62 flow [2025-04-26 16:21:50,476 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:50,476 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:50,476 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:50,476 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:50,476 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:50,476 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:50,477 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:50,477 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:50,478 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:50,539 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 216 [2025-04-26 16:21:50,539 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:50,539 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:50,542 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:50,542 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:50,542 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:50,542 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 233 states, but on-demand construction may add more states [2025-04-26 16:21:50,551 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 216 [2025-04-26 16:21:50,551 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:50,551 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:50,552 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:50,552 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:50,555 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" [2025-04-26 16:21:50,556 INFO L754 eck$LassoCheckResult]: Loop: "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" [2025-04-26 16:21:50,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:50,560 INFO L85 PathProgramCache]: Analyzing trace with hash 124745, now seen corresponding path program 1 times [2025-04-26 16:21:50,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:50,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714150207] [2025-04-26 16:21:50,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:50,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:50,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:50,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:50,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:50,611 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:50,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:50,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:50,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:50,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:50,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:50,631 INFO L85 PathProgramCache]: Analyzing trace with hash -211351289, now seen corresponding path program 1 times [2025-04-26 16:21:50,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:50,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678595968] [2025-04-26 16:21:50,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:50,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:50,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:50,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:50,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:50,656 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:50,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:50,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:50,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:50,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:50,671 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:50,671 INFO L85 PathProgramCache]: Analyzing trace with hash -707712945, now seen corresponding path program 1 times [2025-04-26 16:21:50,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:50,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534696774] [2025-04-26 16:21:50,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:50,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:50,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:21:50,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:21:50,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:50,686 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:50,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:21:50,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:21:50,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:50,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:50,853 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:50,854 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:50,854 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:50,854 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:50,854 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:50,854 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:50,854 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:50,854 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:50,854 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:21:50,854 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:50,855 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:50,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:50,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:50,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:51,041 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:51,044 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:51,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,048 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:21:51,049 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:21:51,050 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:21:51,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:51,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:51,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:51,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:51,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:51,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:51,074 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:51,081 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:21:51,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,084 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:21:51,086 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:21:51,087 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:21:51,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:51,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:51,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:51,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:51,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:51,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:51,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:51,100 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:51,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:21:51,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,108 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:51,109 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:21:51,110 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:21:51,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:51,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:51,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:51,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:51,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:51,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:51,141 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:51,160 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:21:51,160 INFO L437 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:21:51,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,163 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:21:51,164 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:21:51,165 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:51,185 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:21:51,186 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:51,186 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:51,186 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(cnt, N) = -1*cnt + 1*N Supporting invariants [] [2025-04-26 16:21:51,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:21:51,195 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:51,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:51,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:51,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:51,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:51,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:51,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:51,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:51,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:51,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:51,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:21:51,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:51,487 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:21:51,510 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 16:21:51,512 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 233 states, but on-demand construction may add more states Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (in total 11), 6 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:21:51,797 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 233 states, but on-demand construction may add more states. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (in total 11), 6 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 553 states and 1420 transitions. Complement of second has 13 states. [2025-04-26 16:21:51,798 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-04-26 16:21:51,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (in total 11), 6 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:21:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2025-04-26 16:21:51,808 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 3 letters. Loop has 8 letters. [2025-04-26 16:21:51,809 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:51,810 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 11 letters. Loop has 8 letters. [2025-04-26 16:21:51,810 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:51,810 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 3 letters. Loop has 16 letters. [2025-04-26 16:21:51,811 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:51,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 553 states and 1420 transitions. [2025-04-26 16:21:51,827 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:21:51,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 553 states to 386 states and 984 transitions. [2025-04-26 16:21:51,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 299 [2025-04-26 16:21:51,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 324 [2025-04-26 16:21:51,835 INFO L74 IsDeterministic]: Start isDeterministic. Operand 386 states and 984 transitions. [2025-04-26 16:21:51,836 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:51,836 INFO L218 hiAutomatonCegarLoop]: Abstraction has 386 states and 984 transitions. [2025-04-26 16:21:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 984 transitions. [2025-04-26 16:21:51,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 332. [2025-04-26 16:21:51,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 332 states have (on average 2.6144578313253013) internal successors, (in total 868), 331 states have internal predecessors, (868), 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:21:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 868 transitions. [2025-04-26 16:21:51,873 INFO L240 hiAutomatonCegarLoop]: Abstraction has 332 states and 868 transitions. [2025-04-26 16:21:51,873 INFO L438 stractBuchiCegarLoop]: Abstraction has 332 states and 868 transitions. [2025-04-26 16:21:51,873 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:21:51,873 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 332 states and 868 transitions. [2025-04-26 16:21:51,875 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:21:51,875 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:51,875 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:51,876 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:51,876 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:51,876 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[101] L39-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:21:51,876 INFO L754 eck$LassoCheckResult]: Loop: "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" [2025-04-26 16:21:51,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:51,877 INFO L85 PathProgramCache]: Analyzing trace with hash 119884014, now seen corresponding path program 1 times [2025-04-26 16:21:51,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:51,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823965751] [2025-04-26 16:21:51,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:51,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:51,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:51,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:51,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,881 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:51,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:51,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:51,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:51,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:51,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1642647271, now seen corresponding path program 1 times [2025-04-26 16:21:51,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:51,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83161616] [2025-04-26 16:21:51,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:51,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:51,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:51,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:51,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,894 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:51,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:51,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:51,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:51,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:51,899 INFO L85 PathProgramCache]: Analyzing trace with hash -157230380, now seen corresponding path program 1 times [2025-04-26 16:21:51,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:51,900 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384016139] [2025-04-26 16:21:51,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:51,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:51,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:21:51,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:21:51,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:51,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:21:51,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:21:51,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:51,997 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:51,997 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:51,997 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:51,997 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:51,997 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:51,997 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,997 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:51,997 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:51,997 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:21:51,997 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:51,997 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:51,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,100 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:52,101 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:52,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,103 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:21:52,103 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:21:52,105 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:21:52,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,119 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:21:52,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,129 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:21:52,130 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:21:52,131 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:21:52,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,149 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,155 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:21:52,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,157 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:21:52,159 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:21:52,160 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:21:52,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:52,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:52,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:52,173 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:52,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,184 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:21:52,186 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:21:52,187 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:21:52,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:52,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:52,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:52,200 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,206 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:21:52,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,208 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:21:52,212 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:21:52,213 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:21:52,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:52,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:52,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:52,226 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:52,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,234 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:21:52,234 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:21:52,237 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:21:52,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,254 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,263 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:21:52,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,265 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:21:52,267 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:21:52,268 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:21:52,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:52,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:52,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:52,280 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,285 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:21:52,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,287 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:21:52,288 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:21:52,290 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:21:52,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,322 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:52,338 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:21:52,338 INFO L437 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:21:52,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,340 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:21:52,341 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:21:52,342 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:52,359 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:21:52,359 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:52,359 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:52,359 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2025-04-26 16:21:52,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:52,366 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:52,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:52,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:52,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:52,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:52,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:52,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:52,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:52,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:52,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:21:52,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:52,559 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:21:52,559 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 16:21:52,560 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 332 states and 868 transitions. cyclomatic complexity: 555 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (in total 13), 6 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:21:52,743 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 332 states and 868 transitions. cyclomatic complexity: 555. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (in total 13), 6 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 515 states and 1274 transitions. Complement of second has 13 states. [2025-04-26 16:21:52,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-04-26 16:21:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (in total 13), 6 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:21:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2025-04-26 16:21:52,744 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 61 transitions. Stem has 5 letters. Loop has 8 letters. [2025-04-26 16:21:52,744 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:52,744 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 61 transitions. Stem has 13 letters. Loop has 8 letters. [2025-04-26 16:21:52,744 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:52,744 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 61 transitions. Stem has 5 letters. Loop has 16 letters. [2025-04-26 16:21:52,745 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:52,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 515 states and 1274 transitions. [2025-04-26 16:21:52,749 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2025-04-26 16:21:52,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 515 states to 381 states and 950 transitions. [2025-04-26 16:21:52,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 310 [2025-04-26 16:21:52,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 319 [2025-04-26 16:21:52,752 INFO L74 IsDeterministic]: Start isDeterministic. Operand 381 states and 950 transitions. [2025-04-26 16:21:52,752 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:52,752 INFO L218 hiAutomatonCegarLoop]: Abstraction has 381 states and 950 transitions. [2025-04-26 16:21:52,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states and 950 transitions. [2025-04-26 16:21:52,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 332. [2025-04-26 16:21:52,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 332 states have (on average 2.566265060240964) internal successors, (in total 852), 331 states have internal predecessors, (852), 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:21:52,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 852 transitions. [2025-04-26 16:21:52,763 INFO L240 hiAutomatonCegarLoop]: Abstraction has 332 states and 852 transitions. [2025-04-26 16:21:52,764 INFO L438 stractBuchiCegarLoop]: Abstraction has 332 states and 852 transitions. [2025-04-26 16:21:52,764 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:21:52,764 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 332 states and 852 transitions. [2025-04-26 16:21:52,767 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:21:52,767 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:52,767 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:52,768 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:21:52,768 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:52,769 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[101] L39-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:21:52,769 INFO L754 eck$LassoCheckResult]: Loop: "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" [2025-04-26 16:21:52,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,770 INFO L85 PathProgramCache]: Analyzing trace with hash -578562420, now seen corresponding path program 1 times [2025-04-26 16:21:52,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:52,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822918591] [2025-04-26 16:21:52,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:52,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:52,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:52,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:52,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:52,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:52,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:52,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:52,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1657046053, now seen corresponding path program 2 times [2025-04-26 16:21:52,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:52,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041101165] [2025-04-26 16:21:52,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:21:52,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:52,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:52,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:52,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:21:52,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,787 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:52,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:52,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:52,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:52,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,795 INFO L85 PathProgramCache]: Analyzing trace with hash -38693018, now seen corresponding path program 2 times [2025-04-26 16:21:52,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:52,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421389453] [2025-04-26 16:21:52,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:21:52,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:52,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:21:52,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:21:52,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:21:52,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,808 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:52,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:21:52,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:21:52,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:52,898 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:52,898 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:52,898 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:52,898 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:52,898 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:52,898 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,898 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:52,898 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:52,898 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:21:52,898 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:52,898 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:52,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,005 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:53,005 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:53,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:53,007 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:21:53,009 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:21:53,010 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:21:53,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:53,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:53,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:53,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:53,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:53,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:53,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:53,021 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:53,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:21:53,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:53,028 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:21:53,029 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:21:53,030 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:21:53,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:53,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:53,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:53,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:53,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:53,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:53,045 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:53,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:21:53,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:53,069 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:21:53,072 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:21:53,072 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:21:53,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:53,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:53,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:53,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:53,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:53,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:53,087 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:53,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:21:53,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:53,096 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:21:53,097 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:21:53,098 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:21:53,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:53,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:53,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:53,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:53,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:53,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:53,123 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:53,137 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:21:53,137 INFO L437 ModelExtractionUtils]: 8 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:21:53,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:53,139 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:21:53,140 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:21:53,141 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:53,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:21:53,158 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:53,158 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:53,158 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(cnt, workerThread1of1ForFork1_steal_delta#1, N) = -2*cnt - 2*workerThread1of1ForFork1_steal_delta#1 + 3*N Supporting invariants [] [2025-04-26 16:21:53,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:53,164 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:53,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:53,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:53,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:53,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:53,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:53,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:53,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:53,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:53,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:53,192 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:21:53,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:53,297 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:21:53,297 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 16:21:53,297 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 332 states and 852 transitions. cyclomatic complexity: 539 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (in total 14), 7 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:21:53,396 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 332 states and 852 transitions. cyclomatic complexity: 539. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (in total 14), 7 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 408 states and 1017 transitions. Complement of second has 12 states. [2025-04-26 16:21:53,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-04-26 16:21:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (in total 14), 7 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:21:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2025-04-26 16:21:53,397 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 50 transitions. Stem has 6 letters. Loop has 8 letters. [2025-04-26 16:21:53,397 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:53,398 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 50 transitions. Stem has 14 letters. Loop has 8 letters. [2025-04-26 16:21:53,398 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:53,398 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 50 transitions. Stem has 6 letters. Loop has 16 letters. [2025-04-26 16:21:53,398 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:53,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 408 states and 1017 transitions. [2025-04-26 16:21:53,401 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:21:53,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 408 states to 332 states and 844 transitions. [2025-04-26 16:21:53,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2025-04-26 16:21:53,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2025-04-26 16:21:53,405 INFO L74 IsDeterministic]: Start isDeterministic. Operand 332 states and 844 transitions. [2025-04-26 16:21:53,405 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:53,405 INFO L218 hiAutomatonCegarLoop]: Abstraction has 332 states and 844 transitions. [2025-04-26 16:21:53,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states and 844 transitions. [2025-04-26 16:21:53,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-04-26 16:21:53,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 332 states have (on average 2.5421686746987953) internal successors, (in total 844), 331 states have internal predecessors, (844), 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:21:53,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 844 transitions. [2025-04-26 16:21:53,419 INFO L240 hiAutomatonCegarLoop]: Abstraction has 332 states and 844 transitions. [2025-04-26 16:21:53,419 INFO L438 stractBuchiCegarLoop]: Abstraction has 332 states and 844 transitions. [2025-04-26 16:21:53,419 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:21:53,419 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 332 states and 844 transitions. [2025-04-26 16:21:53,421 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:21:53,421 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:53,421 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:53,421 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:53,421 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:53,422 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" [2025-04-26 16:21:53,422 INFO L754 eck$LassoCheckResult]: Loop: "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" [2025-04-26 16:21:53,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:53,422 INFO L85 PathProgramCache]: Analyzing trace with hash -755565317, now seen corresponding path program 1 times [2025-04-26 16:21:53,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:53,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897946291] [2025-04-26 16:21:53,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:53,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:53,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:53,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:53,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:53,427 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:53,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:53,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:53,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:53,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:53,435 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:53,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1140133723, now seen corresponding path program 3 times [2025-04-26 16:21:53,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:53,436 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236810542] [2025-04-26 16:21:53,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:21:53,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:53,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:53,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:53,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:21:53,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:53,444 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:53,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:53,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:53,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:53,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:53,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:53,451 INFO L85 PathProgramCache]: Analyzing trace with hash -385584555, now seen corresponding path program 1 times [2025-04-26 16:21:53,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:53,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623941679] [2025-04-26 16:21:53,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:53,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:53,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:21:53,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:21:53,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:53,465 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:53,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:21:53,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:21:53,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:53,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:53,586 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:53,586 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:53,586 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:53,586 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:53,586 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:53,586 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,586 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:53,586 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:53,586 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:21:53,586 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:53,586 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:53,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,874 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:53,875 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:53,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:53,877 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:21:53,878 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:21:53,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:21:53,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:53,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:53,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:53,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:53,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:53,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:53,894 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:53,900 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:21:53,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:53,903 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:21:53,904 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:21:53,905 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:21:53,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:53,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:53,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:53,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:53,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:53,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:53,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:53,918 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:53,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:21:53,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:53,926 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:21:53,927 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:21:53,929 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:21:53,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:53,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:53,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:53,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:53,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:53,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:53,942 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:53,948 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:21:53,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:53,950 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:21:53,951 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:21:53,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:53,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:53,962 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:21:53,962 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:53,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:53,972 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:21:53,972 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:53,998 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:54,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,007 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:21:54,008 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:21:54,010 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:21:54,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:54,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:54,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:54,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:54,023 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,029 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:21:54,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,031 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:21:54,032 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:21:54,032 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:21:54,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:54,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:54,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:54,046 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:21:54,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,054 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:21:54,055 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:21:54,056 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:21:54,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:54,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:54,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:54,071 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,078 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:21:54,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,080 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:21:54,082 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:21:54,083 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:21:54,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:54,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:54,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:54,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:54,096 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,102 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:21:54,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,105 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:21:54,105 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:21:54,106 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:21:54,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:54,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:54,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:54,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:54,118 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,125 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:21:54,125 INFO L453 LassoAnalysis]: Using template '2-nested'. [2025-04-26 16:21:54,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,127 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:21:54,128 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:21:54,129 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:21:54,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,139 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:54,141 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:21:54,141 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:21:54,145 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,151 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:21:54,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,153 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:21:54,154 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:21:54,156 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:21:54,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:54,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,166 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:54,166 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:21:54,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:54,168 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:54,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,176 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:21:54,177 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:21:54,178 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:21:54,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,189 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:54,190 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:21:54,190 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:21:54,194 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:54,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,202 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:21:54,203 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:21:54,205 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:21:54,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,216 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:21:54,216 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:54,216 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:54,230 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:21:54,230 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:21:54,256 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,263 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:21:54,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,265 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:21:54,265 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:21:54,269 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:21:54,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:54,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,279 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:54,280 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:21:54,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:54,281 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:54,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,288 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:21:54,289 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:21:54,292 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:21:54,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,302 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:54,305 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:21:54,305 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:21:54,308 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,317 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:21:54,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,319 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:21:54,320 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:21:54,321 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:21:54,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,332 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:54,333 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:21:54,333 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:21:54,336 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:54,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,343 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:21:54,344 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:21:54,345 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:21:54,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:54,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,355 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:54,355 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:21:54,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:54,356 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,362 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:21:54,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,364 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:21:54,364 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:21:54,365 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:21:54,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:54,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,375 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:54,375 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:21:54,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:54,376 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 16:21:54,382 INFO L453 LassoAnalysis]: Using template '3-nested'. [2025-04-26 16:21:54,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,384 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:21:54,384 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:21:54,386 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:21:54,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,396 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:54,398 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:54,398 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:54,402 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,408 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:21:54,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,410 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:21:54,410 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:21:54,411 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:21:54,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:54,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,421 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:54,422 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:21:54,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:54,423 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 16:21:54,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,430 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:21:54,431 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:21:54,432 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:21:54,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,443 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:54,445 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:54,445 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:54,448 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 16:21:54,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,456 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:21:54,457 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:21:54,458 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:21:54,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,469 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:21:54,469 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:54,469 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:54,489 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2025-04-26 16:21:54,489 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:21:54,524 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,530 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:21:54,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,533 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:21:54,534 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:21:54,535 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:21:54,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:54,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,546 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:54,546 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:21:54,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:54,548 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:54,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,556 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:21:54,558 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:21:54,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:21:54,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,569 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:54,570 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:54,571 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:54,575 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:54,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,583 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:21:54,584 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:21:54,585 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:21:54,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,596 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:54,597 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:54,597 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:54,600 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,606 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:21:54,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,608 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:21:54,609 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:21:54,610 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:21:54,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:54,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,620 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:54,620 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:21:54,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:54,622 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:54,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,630 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:21:54,631 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:21:54,632 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:21:54,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:54,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,643 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:54,643 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:21:54,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:54,644 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,649 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:21:54,649 INFO L453 LassoAnalysis]: Using template '4-nested'. [2025-04-26 16:21:54,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,652 INFO L229 MonitoredProcess]: Starting monitored process 47 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:21:54,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 16:21:54,654 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:21:54,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,664 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:54,667 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:21:54,667 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:21:54,673 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-04-26 16:21:54,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,681 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:21:54,682 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:21:54,684 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:21:54,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:54,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,694 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:54,696 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:21:54,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:54,697 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,703 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:21:54,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,705 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:21:54,706 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:21:54,707 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:21:54,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,717 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:54,719 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:21:54,719 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:21:54,723 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,728 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:21:54,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,730 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:21:54,731 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:21:54,732 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:21:54,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,743 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:21:54,743 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:54,743 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:54,763 INFO L402 nArgumentSynthesizer]: We have 50 Motzkin's Theorem applications. [2025-04-26 16:21:54,763 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2025-04-26 16:21:54,804 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,812 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:21:54,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,814 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:21:54,815 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:21:54,815 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:21:54,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:54,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,826 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:54,826 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:21:54,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:54,828 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:54,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,836 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:21:54,837 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:21:54,838 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:21:54,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,848 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:54,849 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:21:54,850 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:21:54,854 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,859 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:21:54,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,861 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:21:54,861 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:21:54,862 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:21:54,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,872 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:54,874 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:21:54,874 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:21:54,879 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,884 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:21:54,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,886 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:21:54,888 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:21:54,888 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:21:54,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:54,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,899 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:54,899 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:21:54,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:54,901 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:54,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,908 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:21:54,909 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:21:54,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:21:54,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:54,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,921 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:54,922 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:21:54,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:54,923 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,929 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:21:54,929 INFO L453 LassoAnalysis]: Using template '2-phase'. [2025-04-26 16:21:54,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,931 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:21:54,931 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:21:54,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:21:54,943 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:54,943 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:54,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,943 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:54,945 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:21:54,945 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:21:54,949 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,955 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:21:54,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,957 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:21:54,958 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:21:54,959 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:21:54,969 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:54,969 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:54,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:54,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,970 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:54,970 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:21:54,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:54,972 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,977 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:21:54,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,979 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:21:54,980 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:21:54,981 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:21:54,991 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:54,991 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:54,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,991 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:54,992 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:21:54,992 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:21:55,005 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-04-26 16:21:55,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,013 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:21:55,014 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:21:55,015 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:21:55,025 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,025 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:55,025 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:21:55,025 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:55,025 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:55,038 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:21:55,038 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:21:55,068 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,075 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:21:55,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,078 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:21:55,079 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:21:55,080 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:21:55,090 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,090 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:55,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:55,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,090 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:55,091 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:21:55,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:55,093 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:55,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,101 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:21:55,101 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:21:55,103 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:21:55,113 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,114 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:55,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,114 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:55,115 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:21:55,115 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:21:55,119 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:55,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,126 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:21:55,127 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:21:55,128 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:21:55,137 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,138 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:55,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,138 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:55,139 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:21:55,139 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:21:55,142 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,148 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:21:55,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,150 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:21:55,151 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:21:55,152 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:21:55,162 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,162 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:55,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:55,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,162 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:55,163 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:21:55,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:55,164 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-04-26 16:21:55,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,172 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:21:55,172 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:21:55,173 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:21:55,183 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,183 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:55,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:55,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,183 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:55,184 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:21:55,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:55,185 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,190 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:21:55,191 INFO L453 LassoAnalysis]: Using template '3-phase'. [2025-04-26 16:21:55,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,193 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:21:55,194 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:21:55,194 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:21:55,204 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,204 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:21:55,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,204 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:55,206 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:55,206 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:55,212 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,218 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:21:55,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,221 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:21:55,222 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:21:55,223 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:21:55,233 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,233 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:21:55,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:55,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,233 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:55,233 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:21:55,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:55,235 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,241 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:21:55,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,272 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:21:55,273 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:21:55,274 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:21:55,286 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,287 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:21:55,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,287 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:55,288 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:55,288 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:55,293 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,299 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:21:55,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,301 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:21:55,302 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:21:55,302 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:21:55,313 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,313 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:21:55,313 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:21:55,313 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:55,313 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:55,330 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2025-04-26 16:21:55,330 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:21:55,373 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,382 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:21:55,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,384 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:21:55,385 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:21:55,386 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:21:55,397 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,397 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:21:55,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:55,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,397 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:55,398 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:21:55,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:55,400 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:55,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,409 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:21:55,410 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:21:55,411 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:21:55,422 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,422 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:21:55,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,422 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:55,424 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:55,424 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:55,429 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,435 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:21:55,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,437 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:21:55,438 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:21:55,440 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:21:55,451 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,451 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:21:55,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,451 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:55,453 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:55,453 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:55,459 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,465 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:21:55,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,467 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:21:55,468 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:21:55,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:21:55,480 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,480 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:21:55,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:55,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,480 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:55,481 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:21:55,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:55,483 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,489 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:21:55,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,491 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:21:55,493 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:21:55,494 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:21:55,504 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,505 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:21:55,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:55,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,505 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:55,505 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:21:55,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:55,507 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:55,514 INFO L453 LassoAnalysis]: Using template '4-phase'. [2025-04-26 16:21:55,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,516 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:21:55,516 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:21:55,518 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:21:55,529 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,529 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:21:55,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,529 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:55,532 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:21:55,532 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:21:55,541 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:55,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,549 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:21:55,550 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:21:55,552 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:21:55,563 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,563 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:21:55,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:55,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,563 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:55,564 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:21:55,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:55,566 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,573 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:21:55,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,575 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:21:55,577 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:21:55,578 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:21:55,588 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,588 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:21:55,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,588 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:55,590 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:21:55,590 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:21:55,597 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,605 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:21:55,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,607 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:21:55,608 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:21:55,610 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:21:55,621 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,621 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:21:55,621 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:21:55,621 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:55,621 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:55,644 INFO L402 nArgumentSynthesizer]: We have 50 Motzkin's Theorem applications. [2025-04-26 16:21:55,644 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2025-04-26 16:21:55,725 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,736 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:21:55,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,738 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:21:55,738 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:21:55,740 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:21:55,750 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,750 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:21:55,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:55,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,750 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:55,751 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:21:55,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:55,754 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,759 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:21:55,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,761 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:21:55,761 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:21:55,762 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:21:55,772 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,772 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:21:55,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,772 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:55,774 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:21:55,774 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:21:55,780 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,786 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:21:55,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,788 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:21:55,797 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:21:55,797 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:21:55,807 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,808 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:21:55,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,808 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:55,810 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:21:55,810 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:21:55,816 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,822 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:21:55,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,824 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:21:55,825 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:21:55,826 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:21:55,836 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,836 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:21:55,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:55,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,837 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:55,837 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:21:55,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:55,840 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,845 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:21:55,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,847 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:21:55,847 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:21:55,848 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:21:55,859 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,859 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:21:55,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:55,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,859 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:55,860 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:21:55,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:55,863 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,868 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:21:55,869 INFO L453 LassoAnalysis]: Using template '2-lex'. [2025-04-26 16:21:55,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,870 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:21:55,871 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:21:55,872 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:21:55,883 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,883 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:55,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,883 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:55,885 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:55,885 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:55,890 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,897 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:21:55,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,899 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:21:55,900 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:21:55,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:21:55,911 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,911 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:55,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:55,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,911 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:55,911 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:21:55,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:55,913 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-04-26 16:21:55,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,920 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:21:55,920 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:21:55,921 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:21:55,931 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,931 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:55,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,932 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:55,933 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:55,933 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:55,937 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,942 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:21:55,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,944 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:21:55,945 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:21:55,945 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:21:55,955 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:55,955 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:55,955 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:21:55,955 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:55,955 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:55,971 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2025-04-26 16:21:55,972 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:21:56,026 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:56,110 INFO L436 ModelExtractionUtils]: Simplification made 28 calls to the SMT solver. [2025-04-26 16:21:56,111 INFO L437 ModelExtractionUtils]: 24 out of 52 variables were initially zero. Simplification set additionally 20 variables to zero. [2025-04-26 16:21:56,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:56,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:56,113 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:21:56,113 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:21:56,114 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:56,134 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:21:56,135 INFO L439 nArgumentSynthesizer]: Removed 7 redundant supporting invariants from a total of 8. [2025-04-26 16:21:56,135 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:56,135 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function 2-lexicographic ranking function: f(cnt, N, workerThread1of1ForFork1_steal_x#1) = Supporting invariants [-3*cnt + 4*N >= 0] [2025-04-26 16:21:56,143 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:21:56,146 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:21:56,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:56,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:56,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:56,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:56,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:56,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:56,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:56,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:56,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:56,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:56,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:56,173 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:21:56,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:56,252 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:21:56,252 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 16:21:56,252 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 332 states and 844 transitions. cyclomatic complexity: 531 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (in total 15), 6 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:21:56,440 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 332 states and 844 transitions. cyclomatic complexity: 531. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (in total 15), 6 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 930 states and 2383 transitions. Complement of second has 15 states. [2025-04-26 16:21:56,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 16:21:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (in total 15), 6 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:21:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2025-04-26 16:21:56,441 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 110 transitions. Stem has 7 letters. Loop has 8 letters. [2025-04-26 16:21:56,441 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:56,441 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 110 transitions. Stem has 15 letters. Loop has 8 letters. [2025-04-26 16:21:56,441 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:56,441 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 110 transitions. Stem has 7 letters. Loop has 16 letters. [2025-04-26 16:21:56,442 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:56,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 930 states and 2383 transitions. [2025-04-26 16:21:56,448 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:21:56,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 930 states to 725 states and 1850 transitions. [2025-04-26 16:21:56,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 479 [2025-04-26 16:21:56,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 512 [2025-04-26 16:21:56,454 INFO L74 IsDeterministic]: Start isDeterministic. Operand 725 states and 1850 transitions. [2025-04-26 16:21:56,454 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:56,454 INFO L218 hiAutomatonCegarLoop]: Abstraction has 725 states and 1850 transitions. [2025-04-26 16:21:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states and 1850 transitions. [2025-04-26 16:21:56,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 615. [2025-04-26 16:21:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 615 states have (on average 2.6178861788617884) internal successors, (in total 1610), 614 states have internal predecessors, (1610), 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:21:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 1610 transitions. [2025-04-26 16:21:56,468 INFO L240 hiAutomatonCegarLoop]: Abstraction has 615 states and 1610 transitions. [2025-04-26 16:21:56,468 INFO L438 stractBuchiCegarLoop]: Abstraction has 615 states and 1610 transitions. [2025-04-26 16:21:56,468 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:21:56,469 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 615 states and 1610 transitions. [2025-04-26 16:21:56,471 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:21:56,471 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:56,471 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:56,472 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:56,472 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:56,472 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" [2025-04-26 16:21:56,473 INFO L754 eck$LassoCheckResult]: Loop: "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" [2025-04-26 16:21:56,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:56,473 INFO L85 PathProgramCache]: Analyzing trace with hash 876877675, now seen corresponding path program 1 times [2025-04-26 16:21:56,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:56,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674602565] [2025-04-26 16:21:56,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:56,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:56,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:56,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:56,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:56,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:56,478 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:56,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:56,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:56,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:56,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:56,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:56,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:56,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1140133723, now seen corresponding path program 4 times [2025-04-26 16:21:56,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:56,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140206990] [2025-04-26 16:21:56,490 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:21:56,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:56,494 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:21:56,498 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:56,498 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:21:56,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:56,498 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:56,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:56,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:56,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:56,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:56,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:56,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:56,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2122849477, now seen corresponding path program 1 times [2025-04-26 16:21:56,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:56,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247020014] [2025-04-26 16:21:56,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:56,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:56,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:21:56,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:21:56,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:56,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:56,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:56,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:21:56,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:21:56,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:56,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:56,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:56,688 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:56,688 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:56,688 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:56,688 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:56,688 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:56,688 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:56,689 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:56,689 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:56,689 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:21:56,689 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:56,689 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:56,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:56,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:56,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:56,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:56,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:56,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:56,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:57,023 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:21:57,231 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:57,232 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:57,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,238 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:21:57,239 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:21:57,241 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:21:57,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:57,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:57,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:57,257 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:57,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,270 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:21:57,271 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:21:57,271 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:21:57,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,286 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,291 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:21:57,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,293 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:21:57,294 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:21:57,295 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:21:57,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,308 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,313 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:21:57,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,315 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:21:57,315 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:21:57,316 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:21:57,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,329 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,334 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:21:57,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,336 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:21:57,336 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:21:57,337 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:21:57,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,347 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:21:57,347 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:57,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,355 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:21:57,356 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:57,374 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,380 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:21:57,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,382 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:21:57,383 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:21:57,384 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:21:57,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:57,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:57,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:57,394 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,400 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:21:57,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,402 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:21:57,402 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:21:57,403 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:21:57,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,415 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,421 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:21:57,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,423 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:21:57,425 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:21:57,426 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:21:57,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,439 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2025-04-26 16:21:57,445 INFO L453 LassoAnalysis]: Using template '2-nested'. [2025-04-26 16:21:57,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,447 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:21:57,447 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:21:57,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:21:57,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:57,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,458 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:57,459 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:21:57,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:57,460 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,465 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:21:57,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,467 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:21:57,468 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:21:57,469 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:21:57,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,479 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:57,479 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:21:57,480 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:21:57,482 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,488 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:21:57,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,490 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:21:57,491 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:21:57,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:21:57,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,502 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:57,503 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:21:57,503 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:21:57,507 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,512 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:21:57,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,514 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:21:57,515 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:21:57,516 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:21:57,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,526 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:57,526 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:21:57,527 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:21:57,529 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:57,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,539 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:21:57,539 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:21:57,540 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:21:57,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,550 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:21:57,551 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:57,551 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:57,564 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2025-04-26 16:21:57,565 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:21:57,595 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,601 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:21:57,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,603 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:21:57,603 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:21:57,604 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:21:57,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:57,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,614 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:57,614 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:21:57,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:57,615 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:57,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,623 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:21:57,624 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:21:57,624 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:21:57,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,634 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:57,638 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:21:57,638 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:21:57,641 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2025-04-26 16:21:57,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,649 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:21:57,650 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:21:57,651 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:21:57,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,661 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:57,662 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:21:57,662 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:21:57,665 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:57,670 INFO L453 LassoAnalysis]: Using template '3-nested'. [2025-04-26 16:21:57,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,672 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:21:57,672 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:21:57,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:21:57,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:57,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,683 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:57,683 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:21:57,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:57,684 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:57,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,692 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:21:57,692 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:21:57,693 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:21:57,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,703 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:57,705 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:57,705 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:57,708 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,714 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:21:57,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,716 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:21:57,718 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:21:57,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:57,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,729 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:57,731 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:57,731 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:57,737 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,743 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:21:57,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,745 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:21:57,746 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:21:57,747 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:21:57,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,758 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:57,760 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:57,760 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:57,764 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:57,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,772 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:21:57,773 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:21:57,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:57,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,786 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:21:57,786 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:57,786 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:57,806 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:21:57,806 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:21:57,847 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:57,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,856 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:21:57,857 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:21:57,858 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:21:57,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:57,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,868 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:57,869 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:21:57,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:57,870 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,877 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:21:57,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,879 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:21:57,880 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:21:57,881 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:21:57,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,892 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:57,893 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:57,893 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:57,899 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:57,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,908 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:21:57,909 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:21:57,911 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:21:57,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,921 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:57,923 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:57,923 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:57,926 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,932 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:21:57,932 INFO L453 LassoAnalysis]: Using template '4-nested'. [2025-04-26 16:21:57,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,935 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:21:57,936 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:21:57,938 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:21:57,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:57,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,948 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:57,949 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:21:57,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:57,950 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:57,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,959 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:21:57,959 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:21:57,961 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:21:57,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,972 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:57,975 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:21:57,975 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:21:57,982 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:57,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,989 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:21:57,990 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:21:57,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:21:58,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:58,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,003 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:58,005 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:21:58,006 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:21:58,012 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:58,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,020 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:21:58,021 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:21:58,022 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:21:58,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:58,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,033 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:58,034 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:21:58,034 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:21:58,038 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2025-04-26 16:21:58,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,045 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:21:58,045 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:21:58,046 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:21:58,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:58,057 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:21:58,057 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:58,057 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:58,089 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2025-04-26 16:21:58,089 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2025-04-26 16:21:58,138 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,144 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:21:58,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,146 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:21:58,147 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:21:58,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:58,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:58,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:58,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,158 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:58,158 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:21:58,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:58,160 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,165 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:21:58,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,167 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:21:58,167 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:21:58,168 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:21:58,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:58,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,178 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:58,180 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:21:58,180 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:21:58,185 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,191 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:21:58,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,193 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:21:58,194 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:21:58,194 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:21:58,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:58,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,205 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:58,206 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:21:58,206 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:21:58,211 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,217 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:21:58,217 INFO L453 LassoAnalysis]: Using template '2-phase'. [2025-04-26 16:21:58,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,219 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:21:58,221 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:21:58,222 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:21:58,232 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,232 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:58,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:58,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,232 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:58,232 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:21:58,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:58,234 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,240 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:21:58,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,242 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:21:58,243 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:21:58,245 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:21:58,255 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,255 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:58,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,255 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:58,257 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:21:58,257 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:21:58,262 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:58,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,270 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:21:58,271 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:21:58,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:21:58,282 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,283 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:58,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,283 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:58,284 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:21:58,284 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:21:58,304 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2025-04-26 16:21:58,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,314 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:21:58,316 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:21:58,317 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:21:58,328 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,328 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:58,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,328 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:58,329 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:21:58,330 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:21:58,334 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2025-04-26 16:21:58,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,343 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:21:58,343 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:21:58,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:21:58,355 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,355 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:58,355 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:21:58,355 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:58,356 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:58,368 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2025-04-26 16:21:58,368 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:21:58,420 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:58,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,428 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:21:58,429 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:21:58,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:21:58,448 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,448 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:58,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:58,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,448 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:58,448 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:21:58,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:58,450 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,455 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:21:58,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,457 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:21:58,458 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:21:58,460 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:21:58,469 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,469 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:58,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,470 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:58,471 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:21:58,471 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:21:58,494 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:58,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,503 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:21:58,503 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:21:58,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:21:58,514 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,514 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:58,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,514 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:21:58,515 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:21:58,515 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:21:58,518 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,524 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:21:58,524 INFO L453 LassoAnalysis]: Using template '3-phase'. [2025-04-26 16:21:58,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,527 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:21:58,527 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:21:58,528 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:21:58,538 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,538 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:21:58,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:58,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,538 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:58,538 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:21:58,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:58,540 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,547 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:21:58,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,549 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:21:58,549 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:21:58,551 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:21:58,561 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,561 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:21:58,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,561 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:58,562 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:58,562 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:58,567 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2025-04-26 16:21:58,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,575 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:21:58,575 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:21:58,576 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:21:58,586 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,586 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:21:58,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,586 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:58,590 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:58,590 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:58,597 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-04-26 16:21:58,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,609 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:21:58,609 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:21:58,610 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:21:58,621 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,621 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:21:58,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,621 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:58,623 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:58,623 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:58,628 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,634 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:21:58,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,636 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:21:58,636 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:21:58,637 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:21:58,647 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,648 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:21:58,648 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:21:58,648 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:58,648 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:58,665 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:21:58,665 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:21:58,714 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,720 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:21:58,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,722 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:21:58,723 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:21:58,724 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:21:58,733 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,733 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:21:58,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:58,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,734 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:58,734 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:21:58,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:58,736 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,741 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:21:58,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,743 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:21:58,744 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:21:58,745 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:21:58,754 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,754 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:21:58,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,754 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:58,756 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:58,756 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:58,760 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,765 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:21:58,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,767 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:21:58,768 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:21:58,769 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:21:58,778 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,778 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:21:58,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,779 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:58,780 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:58,780 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:58,792 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2025-04-26 16:21:58,797 INFO L453 LassoAnalysis]: Using template '4-phase'. [2025-04-26 16:21:58,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,799 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:21:58,799 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:21:58,800 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:21:58,810 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,810 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:21:58,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:58,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,810 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:58,811 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:21:58,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:58,814 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,819 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:21:58,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,820 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:21:58,821 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:21:58,822 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:21:58,835 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,835 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:21:58,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,835 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:58,837 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:21:58,837 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:21:58,843 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,848 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:21:58,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,850 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:21:58,851 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:21:58,852 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:21:58,862 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,862 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:21:58,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,862 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:58,864 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:21:58,864 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:21:58,872 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:58,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,880 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:21:58,881 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:21:58,885 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:21:58,895 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,895 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:21:58,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:58,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:58,896 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:58,897 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:21:58,897 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:21:58,904 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:58,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:58,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:58,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:58,911 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:21:58,911 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:21:58,912 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:21:58,923 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:58,923 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:21:58,923 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:21:58,923 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:58,923 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:58,945 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2025-04-26 16:21:58,945 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2025-04-26 16:21:59,008 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:59,015 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:21:59,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:59,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:59,017 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:21:59,017 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:21:59,018 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:21:59,028 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:59,028 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:21:59,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:59,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:59,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:59,028 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:59,029 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:21:59,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:59,031 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:59,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2025-04-26 16:21:59,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:59,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:59,038 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:21:59,039 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:21:59,040 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:21:59,049 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:59,050 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:21:59,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:59,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:59,050 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:59,051 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:21:59,051 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:21:59,060 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:59,065 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:21:59,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:59,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:59,067 INFO L229 MonitoredProcess]: Starting monitored process 143 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:21:59,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2025-04-26 16:21:59,069 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:21:59,079 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:59,079 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:21:59,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:59,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:59,079 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:21:59,081 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:21:59,081 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:21:59,088 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:59,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:59,093 INFO L453 LassoAnalysis]: Using template '2-lex'. [2025-04-26 16:21:59,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:59,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:59,095 INFO L229 MonitoredProcess]: Starting monitored process 144 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:21:59,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2025-04-26 16:21:59,096 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:21:59,105 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:59,106 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:59,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:59,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:59,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:59,106 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:59,106 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:21:59,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:59,108 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:59,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2025-04-26 16:21:59,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:59,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:59,115 INFO L229 MonitoredProcess]: Starting monitored process 145 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:21:59,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2025-04-26 16:21:59,116 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:21:59,126 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:59,126 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:59,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:59,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:59,126 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:59,127 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:59,127 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:59,131 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:59,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2025-04-26 16:21:59,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:59,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:59,138 INFO L229 MonitoredProcess]: Starting monitored process 146 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:21:59,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2025-04-26 16:21:59,141 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:21:59,150 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:59,150 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:59,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:59,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:59,151 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:59,152 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:59,152 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:59,157 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:59,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:59,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:59,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:59,165 INFO L229 MonitoredProcess]: Starting monitored process 147 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:21:59,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2025-04-26 16:21:59,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:59,176 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:59,176 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:59,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:59,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:59,176 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:59,177 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:21:59,177 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:59,181 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:59,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2025-04-26 16:21:59,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:59,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:59,188 INFO L229 MonitoredProcess]: Starting monitored process 148 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:21:59,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2025-04-26 16:21:59,189 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:21:59,199 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:21:59,199 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:21:59,199 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:21:59,199 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:59,199 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:21:59,216 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:21:59,216 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:21:59,280 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:59,338 INFO L436 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2025-04-26 16:21:59,338 INFO L437 ModelExtractionUtils]: 37 out of 62 variables were initially zero. Simplification set additionally 17 variables to zero. [2025-04-26 16:21:59,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:59,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:59,340 INFO L229 MonitoredProcess]: Starting monitored process 149 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:21:59,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2025-04-26 16:21:59,341 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:59,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2025-04-26 16:21:59,360 INFO L439 nArgumentSynthesizer]: Removed 7 redundant supporting invariants from a total of 8. [2025-04-26 16:21:59,360 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:59,360 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function 2-lexicographic ranking function: f(N, cnt, workerThread1of1ForFork1_steal_x#1) = Supporting invariants [-3*cnt + 4*N >= 0] [2025-04-26 16:21:59,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2025-04-26 16:21:59,373 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:21:59,385 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:59,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:59,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:59,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:59,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:59,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:59,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:59,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:59,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:59,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:59,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:59,407 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:21:59,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:59,468 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:21:59,468 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 16:21:59,469 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 615 states and 1610 transitions. cyclomatic complexity: 1030 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (in total 18), 6 states have internal predecessors, (18), 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:21:59,707 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 615 states and 1610 transitions. cyclomatic complexity: 1030. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (in total 18), 6 states have internal predecessors, (18), 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 1993 states and 4986 transitions. Complement of second has 15 states. [2025-04-26 16:21:59,707 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 16:21:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (in total 18), 6 states have internal predecessors, (18), 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:21:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2025-04-26 16:21:59,708 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 126 transitions. Stem has 10 letters. Loop has 8 letters. [2025-04-26 16:21:59,708 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:59,708 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 126 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:21:59,708 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:59,708 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 126 transitions. Stem has 10 letters. Loop has 16 letters. [2025-04-26 16:21:59,708 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:59,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1993 states and 4986 transitions. [2025-04-26 16:21:59,722 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:21:59,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1993 states to 1519 states and 3881 transitions. [2025-04-26 16:21:59,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 941 [2025-04-26 16:21:59,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1024 [2025-04-26 16:21:59,732 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1519 states and 3881 transitions. [2025-04-26 16:21:59,732 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:59,733 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1519 states and 3881 transitions. [2025-04-26 16:21:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states and 3881 transitions. [2025-04-26 16:21:59,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 701. [2025-04-26 16:21:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 701 states have (on average 2.614835948644793) internal successors, (in total 1833), 700 states have internal predecessors, (1833), 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:21:59,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1833 transitions. [2025-04-26 16:21:59,749 INFO L240 hiAutomatonCegarLoop]: Abstraction has 701 states and 1833 transitions. [2025-04-26 16:21:59,749 INFO L438 stractBuchiCegarLoop]: Abstraction has 701 states and 1833 transitions. [2025-04-26 16:21:59,749 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:21:59,749 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 701 states and 1833 transitions. [2025-04-26 16:21:59,753 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:21:59,753 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:59,753 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:59,754 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:59,754 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:59,754 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:21:59,754 INFO L754 eck$LassoCheckResult]: Loop: "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" [2025-04-26 16:21:59,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:59,754 INFO L85 PathProgramCache]: Analyzing trace with hash 877355803, now seen corresponding path program 1 times [2025-04-26 16:21:59,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:59,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281719147] [2025-04-26 16:21:59,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:59,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:59,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:59,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:59,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:59,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:59,759 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:59,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:59,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:59,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:59,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:59,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:59,765 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:59,765 INFO L85 PathProgramCache]: Analyzing trace with hash -211351289, now seen corresponding path program 2 times [2025-04-26 16:21:59,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:59,768 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853843621] [2025-04-26 16:21:59,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:21:59,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:59,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:59,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:59,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:21:59,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:59,774 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:59,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:59,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:59,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:59,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:59,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:59,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:59,785 INFO L85 PathProgramCache]: Analyzing trace with hash 848474657, now seen corresponding path program 1 times [2025-04-26 16:21:59,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:59,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662779852] [2025-04-26 16:21:59,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:59,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:59,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:21:59,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:21:59,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:59,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:59,892 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:21:59,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:21:59,893 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662779852] [2025-04-26 16:21:59,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662779852] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:21:59,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:21:59,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-26 16:21:59,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158612486] [2025-04-26 16:21:59,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:21:59,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:21:59,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-26 16:21:59,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-26 16:21:59,943 INFO L87 Difference]: Start difference. First operand 701 states and 1833 transitions. cyclomatic complexity: 1173 Second operand has 8 states, 8 states have (on average 2.25) internal successors, (in total 18), 7 states have internal predecessors, (18), 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:00,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:00,053 INFO L93 Difference]: Finished difference Result 1301 states and 3314 transitions. [2025-04-26 16:22:00,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1301 states and 3314 transitions. [2025-04-26 16:22:00,060 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 400 [2025-04-26 16:22:00,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1301 states to 1265 states and 3218 transitions. [2025-04-26 16:22:00,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 818 [2025-04-26 16:22:00,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 818 [2025-04-26 16:22:00,067 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1265 states and 3218 transitions. [2025-04-26 16:22:00,067 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:00,067 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1265 states and 3218 transitions. [2025-04-26 16:22:00,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states and 3218 transitions. [2025-04-26 16:22:00,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 803. [2025-04-26 16:22:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 803 states have (on average 2.6201743462017433) internal successors, (in total 2104), 802 states have internal predecessors, (2104), 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:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 2104 transitions. [2025-04-26 16:22:00,100 INFO L240 hiAutomatonCegarLoop]: Abstraction has 803 states and 2104 transitions. [2025-04-26 16:22:00,101 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-26 16:22:00,101 INFO L438 stractBuchiCegarLoop]: Abstraction has 803 states and 2104 transitions. [2025-04-26 16:22:00,101 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:22:00,101 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 803 states and 2104 transitions. [2025-04-26 16:22:00,104 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 256 [2025-04-26 16:22:00,104 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:00,104 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:00,105 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:00,105 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:00,105 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" [2025-04-26 16:22:00,105 INFO L754 eck$LassoCheckResult]: Loop: "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" [2025-04-26 16:22:00,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:00,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1413418606, now seen corresponding path program 1 times [2025-04-26 16:22:00,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:00,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20065450] [2025-04-26 16:22:00,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:00,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:00,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:00,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:00,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:00,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:00,111 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:00,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:00,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:00,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:00,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:00,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:00,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:00,122 INFO L85 PathProgramCache]: Analyzing trace with hash -712911557, now seen corresponding path program 3 times [2025-04-26 16:22:00,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:00,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533355167] [2025-04-26 16:22:00,122 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:00,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:00,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:00,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:00,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:00,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:00,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:00,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:00,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:00,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:00,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:00,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:00,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:00,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1509303976, now seen corresponding path program 1 times [2025-04-26 16:22:00,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:00,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983264298] [2025-04-26 16:22:00,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:00,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:00,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:22:00,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:22:00,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:00,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:00,140 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:00,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:22:00,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:22:00,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:00,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:00,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:00,311 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:00,311 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:00,311 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:00,311 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:00,311 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:00,311 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:00,311 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:00,311 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:00,311 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:22:00,311 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:00,311 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:00,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:00,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:00,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:00,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:00,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:00,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:00,548 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:22:00,745 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:00,745 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:00,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:00,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:00,747 INFO L229 MonitoredProcess]: Starting monitored process 150 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:00,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2025-04-26 16:22:00,749 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:00,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:00,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:00,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:00,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:00,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:00,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:00,762 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:00,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2025-04-26 16:22:00,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:00,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:00,770 INFO L229 MonitoredProcess]: Starting monitored process 151 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:00,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2025-04-26 16:22:00,771 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:00,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:00,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:00,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:00,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:00,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:00,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:00,784 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:00,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:00,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:00,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:00,793 INFO L229 MonitoredProcess]: Starting monitored process 152 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:00,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2025-04-26 16:22:00,794 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:00,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:00,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:00,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:00,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:00,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:00,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:00,807 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:00,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2025-04-26 16:22:00,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:00,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:00,814 INFO L229 MonitoredProcess]: Starting monitored process 153 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:00,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2025-04-26 16:22:00,816 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:00,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:00,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:00,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:00,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:00,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:00,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:00,829 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:00,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2025-04-26 16:22:00,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:00,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:00,836 INFO L229 MonitoredProcess]: Starting monitored process 154 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:00,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2025-04-26 16:22:00,837 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:00,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:00,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:00,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:00,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:00,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:00,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:00,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:00,848 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:00,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2025-04-26 16:22:00,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:00,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:00,855 INFO L229 MonitoredProcess]: Starting monitored process 155 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:00,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2025-04-26 16:22:00,856 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:00,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:00,866 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:00,866 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:00,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:00,876 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:22:00,876 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:00,899 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:00,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2025-04-26 16:22:00,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:00,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:00,907 INFO L229 MonitoredProcess]: Starting monitored process 156 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:00,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2025-04-26 16:22:00,909 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:00,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:00,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:00,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:00,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:00,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:00,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:00,921 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:00,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2025-04-26 16:22:00,928 INFO L453 LassoAnalysis]: Using template '2-nested'. [2025-04-26 16:22:00,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:00,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:00,929 INFO L229 MonitoredProcess]: Starting monitored process 157 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:00,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2025-04-26 16:22:00,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:22:00,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:00,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:00,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:00,941 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:00,942 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:00,942 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:00,944 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:00,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2025-04-26 16:22:00,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:00,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:00,952 INFO L229 MonitoredProcess]: Starting monitored process 158 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:00,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2025-04-26 16:22:00,953 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:00,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:00,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:00,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:00,963 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:00,965 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:00,965 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:00,968 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:00,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2025-04-26 16:22:00,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:00,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:00,975 INFO L229 MonitoredProcess]: Starting monitored process 159 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:00,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2025-04-26 16:22:00,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:22:00,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:00,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:00,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:00,986 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:00,987 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:00,987 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:00,989 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:00,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2025-04-26 16:22:00,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:00,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:00,996 INFO L229 MonitoredProcess]: Starting monitored process 160 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:00,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2025-04-26 16:22:00,998 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:01,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,007 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:01,008 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:01,008 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:01,011 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2025-04-26 16:22:01,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,018 INFO L229 MonitoredProcess]: Starting monitored process 161 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:01,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2025-04-26 16:22:01,020 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:01,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:01,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,029 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:01,030 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:22:01,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:01,031 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2025-04-26 16:22:01,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,038 INFO L229 MonitoredProcess]: Starting monitored process 162 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:01,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2025-04-26 16:22:01,040 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:01,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,050 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:01,050 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:01,050 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:01,064 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2025-04-26 16:22:01,064 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:01,099 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2025-04-26 16:22:01,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,107 INFO L229 MonitoredProcess]: Starting monitored process 163 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:01,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2025-04-26 16:22:01,108 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:01,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,118 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:01,119 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:01,119 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:01,123 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2025-04-26 16:22:01,128 INFO L453 LassoAnalysis]: Using template '3-nested'. [2025-04-26 16:22:01,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,130 INFO L229 MonitoredProcess]: Starting monitored process 164 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:01,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2025-04-26 16:22:01,132 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:01,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,144 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:01,145 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:01,145 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:01,148 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:01,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,156 INFO L229 MonitoredProcess]: Starting monitored process 165 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:01,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2025-04-26 16:22:01,157 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:01,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,167 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:01,169 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:01,169 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:01,172 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:01,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,179 INFO L229 MonitoredProcess]: Starting monitored process 166 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:01,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2025-04-26 16:22:01,180 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:01,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,190 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:01,191 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:01,191 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:01,195 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2025-04-26 16:22:01,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,201 INFO L229 MonitoredProcess]: Starting monitored process 167 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:01,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2025-04-26 16:22:01,203 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:01,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,213 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:01,214 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:01,214 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:01,217 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:01,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,224 INFO L229 MonitoredProcess]: Starting monitored process 168 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:01,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2025-04-26 16:22:01,225 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:01,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:01,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,235 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:01,235 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:22:01,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:01,237 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2025-04-26 16:22:01,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,248 INFO L229 MonitoredProcess]: Starting monitored process 169 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:01,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2025-04-26 16:22:01,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:01,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,260 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:01,260 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:01,260 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:01,279 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:22:01,279 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:22:01,330 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2025-04-26 16:22:01,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,338 INFO L229 MonitoredProcess]: Starting monitored process 170 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:01,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2025-04-26 16:22:01,340 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:01,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,349 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:01,351 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:01,351 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:01,355 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:01,361 INFO L453 LassoAnalysis]: Using template '4-nested'. [2025-04-26 16:22:01,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,363 INFO L229 MonitoredProcess]: Starting monitored process 171 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:01,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2025-04-26 16:22:01,371 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:01,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,381 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:01,382 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:01,382 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:01,386 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2025-04-26 16:22:01,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,393 INFO L229 MonitoredProcess]: Starting monitored process 172 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:01,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2025-04-26 16:22:01,394 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:01,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,404 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:01,405 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:01,405 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:01,409 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:01,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,417 INFO L229 MonitoredProcess]: Starting monitored process 173 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:01,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2025-04-26 16:22:01,419 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:01,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,430 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:01,431 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:01,431 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:01,435 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:01,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,443 INFO L229 MonitoredProcess]: Starting monitored process 174 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:01,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2025-04-26 16:22:01,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:01,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,455 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:01,456 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:01,456 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:01,460 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2025-04-26 16:22:01,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,467 INFO L229 MonitoredProcess]: Starting monitored process 175 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:01,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2025-04-26 16:22:01,469 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:01,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:01,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,480 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:01,480 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:22:01,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:01,482 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2025-04-26 16:22:01,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,488 INFO L229 MonitoredProcess]: Starting monitored process 176 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:01,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2025-04-26 16:22:01,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:01,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,502 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:01,502 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:01,502 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:01,525 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2025-04-26 16:22:01,525 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2025-04-26 16:22:01,584 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2025-04-26 16:22:01,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,594 INFO L229 MonitoredProcess]: Starting monitored process 177 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:01,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2025-04-26 16:22:01,596 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:01,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,607 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:01,608 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:01,609 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:01,614 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:01,619 INFO L453 LassoAnalysis]: Using template '2-phase'. [2025-04-26 16:22:01,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,621 INFO L229 MonitoredProcess]: Starting monitored process 178 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:01,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2025-04-26 16:22:01,622 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:01,632 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:01,632 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:01,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,633 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:01,633 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:01,634 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:01,637 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2025-04-26 16:22:01,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,644 INFO L229 MonitoredProcess]: Starting monitored process 179 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:01,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2025-04-26 16:22:01,645 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:01,656 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:01,656 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:01,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,656 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:01,657 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:01,658 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:01,661 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2025-04-26 16:22:01,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,669 INFO L229 MonitoredProcess]: Starting monitored process 180 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:01,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2025-04-26 16:22:01,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:22:01,680 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:01,680 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:01,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,680 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:01,681 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:01,681 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:01,684 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:01,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,691 INFO L229 MonitoredProcess]: Starting monitored process 181 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:01,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2025-04-26 16:22:01,693 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:01,702 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:01,703 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:01,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,703 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:01,704 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:01,704 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:01,707 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2025-04-26 16:22:01,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,714 INFO L229 MonitoredProcess]: Starting monitored process 182 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:01,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2025-04-26 16:22:01,716 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:01,725 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:01,726 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:01,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:01,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,726 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:01,726 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:22:01,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:01,728 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2025-04-26 16:22:01,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,735 INFO L229 MonitoredProcess]: Starting monitored process 183 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:01,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2025-04-26 16:22:01,736 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:01,746 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:01,747 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:01,747 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:01,747 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:01,747 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:01,761 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2025-04-26 16:22:01,761 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:01,806 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:01,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,814 INFO L229 MonitoredProcess]: Starting monitored process 184 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:01,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2025-04-26 16:22:01,816 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:01,826 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:01,826 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:01,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,827 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:01,828 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:01,828 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:01,833 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2025-04-26 16:22:01,839 INFO L453 LassoAnalysis]: Using template '3-phase'. [2025-04-26 16:22:01,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,841 INFO L229 MonitoredProcess]: Starting monitored process 185 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:01,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2025-04-26 16:22:01,842 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:01,852 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:01,852 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:01,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,852 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:01,854 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:01,854 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:01,858 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:01,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,865 INFO L229 MonitoredProcess]: Starting monitored process 186 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:01,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2025-04-26 16:22:01,867 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:01,877 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:01,877 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:01,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,877 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:01,878 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:01,878 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:01,883 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2025-04-26 16:22:01,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,890 INFO L229 MonitoredProcess]: Starting monitored process 187 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:01,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2025-04-26 16:22:01,892 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:01,902 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:01,902 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:01,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,902 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:01,903 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:01,903 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:01,908 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2025-04-26 16:22:01,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,916 INFO L229 MonitoredProcess]: Starting monitored process 188 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:01,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2025-04-26 16:22:01,918 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:01,927 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:01,928 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:01,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,928 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:01,929 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:01,929 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:01,934 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2025-04-26 16:22:01,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,941 INFO L229 MonitoredProcess]: Starting monitored process 189 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:01,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2025-04-26 16:22:01,943 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:01,953 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:01,953 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:01,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:01,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,953 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:01,953 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:22:01,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:01,955 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2025-04-26 16:22:01,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,962 INFO L229 MonitoredProcess]: Starting monitored process 190 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:01,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2025-04-26 16:22:01,964 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:01,975 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:01,975 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:01,975 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:01,975 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:01,975 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:01,994 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:22:01,994 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:22:02,127 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:02,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2025-04-26 16:22:02,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:02,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:02,136 INFO L229 MonitoredProcess]: Starting monitored process 191 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:02,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2025-04-26 16:22:02,138 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:02,148 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:02,148 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:02,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:02,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:02,148 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:02,150 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:02,150 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:02,156 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:02,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2025-04-26 16:22:02,161 INFO L453 LassoAnalysis]: Using template '4-phase'. [2025-04-26 16:22:02,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:02,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:02,163 INFO L229 MonitoredProcess]: Starting monitored process 192 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:02,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2025-04-26 16:22:02,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:02,176 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:02,176 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:02,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:02,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:02,176 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:02,177 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:02,177 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:02,184 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:02,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:02,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:02,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:02,191 INFO L229 MonitoredProcess]: Starting monitored process 193 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:02,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2025-04-26 16:22:02,194 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:02,204 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:02,204 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:02,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:02,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:02,205 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:02,206 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:02,206 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:02,212 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:02,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2025-04-26 16:22:02,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:02,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:02,219 INFO L229 MonitoredProcess]: Starting monitored process 194 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:02,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2025-04-26 16:22:02,221 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:02,231 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:02,231 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:02,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:02,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:02,231 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:02,233 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:02,233 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:02,239 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:02,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2025-04-26 16:22:02,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:02,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:02,246 INFO L229 MonitoredProcess]: Starting monitored process 195 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:02,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2025-04-26 16:22:02,248 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:02,258 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:02,259 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:02,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:02,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:02,259 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:02,261 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:02,261 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:02,267 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:02,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:02,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:02,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:02,275 INFO L229 MonitoredProcess]: Starting monitored process 196 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:02,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2025-04-26 16:22:02,278 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:02,288 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:02,289 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:02,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:02,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:02,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:02,289 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:02,289 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:22:02,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:02,292 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:02,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2025-04-26 16:22:02,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:02,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:02,299 INFO L229 MonitoredProcess]: Starting monitored process 197 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:02,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2025-04-26 16:22: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:22:02,312 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:02,312 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:02,312 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:02,312 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:02,312 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:02,342 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2025-04-26 16:22:02,342 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2025-04-26 16:22:02,428 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:02,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2025-04-26 16:22:02,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:02,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:02,437 INFO L229 MonitoredProcess]: Starting monitored process 198 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:02,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2025-04-26 16:22:02,438 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:02,448 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:02,449 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:02,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:02,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:02,449 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:02,451 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:02,451 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:02,459 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:02,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:02,465 INFO L453 LassoAnalysis]: Using template '2-lex'. [2025-04-26 16:22:02,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:02,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:02,467 INFO L229 MonitoredProcess]: Starting monitored process 199 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:02,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2025-04-26 16:22:02,468 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:02,478 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:02,478 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:02,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:02,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:02,478 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:02,480 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:02,480 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:02,483 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:02,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0 [2025-04-26 16:22:02,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:02,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:02,491 INFO L229 MonitoredProcess]: Starting monitored process 200 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:02,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2025-04-26 16:22:02,493 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:02,502 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:02,502 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:02,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:02,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:02,502 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:02,504 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:02,504 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:02,507 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:02,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2025-04-26 16:22:02,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:02,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:02,515 INFO L229 MonitoredProcess]: Starting monitored process 201 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:02,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2025-04-26 16:22:02,516 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:02,526 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:02,526 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:02,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:02,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:02,526 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:02,527 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:02,527 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:02,531 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:02,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Ended with exit code 0 [2025-04-26 16:22:02,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:02,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:02,538 INFO L229 MonitoredProcess]: Starting monitored process 202 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:02,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2025-04-26 16:22:02,540 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:02,549 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:02,549 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:02,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:02,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:02,550 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:02,551 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:02,551 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:02,554 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:02,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:02,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:02,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:02,561 INFO L229 MonitoredProcess]: Starting monitored process 203 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:02,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2025-04-26 16:22:02,563 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:02,572 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:02,572 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:02,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:02,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:02,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:02,573 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:02,573 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:22:02,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:02,574 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:02,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Ended with exit code 0 [2025-04-26 16:22:02,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:02,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:02,581 INFO L229 MonitoredProcess]: Starting monitored process 204 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:02,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2025-04-26 16:22:02,583 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:02,592 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:02,593 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:02,593 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:02,593 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:02,593 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:02,611 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:22:02,612 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:22:02,704 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:02,777 INFO L436 ModelExtractionUtils]: Simplification made 28 calls to the SMT solver. [2025-04-26 16:22:02,777 INFO L437 ModelExtractionUtils]: 45 out of 72 variables were initially zero. Simplification set additionally 19 variables to zero. [2025-04-26 16:22:02,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:02,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:02,779 INFO L229 MonitoredProcess]: Starting monitored process 205 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:02,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2025-04-26 16:22:02,781 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:02,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Ended with exit code 0 [2025-04-26 16:22:02,800 INFO L439 nArgumentSynthesizer]: Removed 7 redundant supporting invariants from a total of 8. [2025-04-26 16:22:02,800 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:02,800 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function 2-lexicographic ranking function: f(N, cnt, workerWithAssertThread1of1ForFork0_steal_x#1) = Supporting invariants [1*N - 1*cnt >= 0] [2025-04-26 16:22:02,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Ended with exit code 0 [2025-04-26 16:22:02,811 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:02,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:02,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:02,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:02,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:02,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:02,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:02,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:02,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:02,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:02,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:02,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:02,844 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:02,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:02,912 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:02,913 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 16:22:02,913 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 803 states and 2104 transitions. cyclomatic complexity: 1348 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (in total 19), 6 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:22:03,079 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 803 states and 2104 transitions. cyclomatic complexity: 1348. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (in total 19), 6 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 2236 states and 5776 transitions. Complement of second has 15 states. [2025-04-26 16:22:03,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (in total 19), 6 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:22:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2025-04-26 16:22:03,080 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 116 transitions. Stem has 11 letters. Loop has 8 letters. [2025-04-26 16:22:03,080 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:03,080 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 116 transitions. Stem has 19 letters. Loop has 8 letters. [2025-04-26 16:22:03,080 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:03,080 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 116 transitions. Stem has 11 letters. Loop has 16 letters. [2025-04-26 16:22:03,080 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:03,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2236 states and 5776 transitions. [2025-04-26 16:22:03,092 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:22:03,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2236 states to 1705 states and 4356 transitions. [2025-04-26 16:22:03,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 771 [2025-04-26 16:22:03,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 860 [2025-04-26 16:22:03,102 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1705 states and 4356 transitions. [2025-04-26 16:22:03,102 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:03,102 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1705 states and 4356 transitions. [2025-04-26 16:22:03,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states and 4356 transitions. [2025-04-26 16:22:03,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1103. [2025-04-26 16:22:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 1103 states have (on average 2.617407071622847) internal successors, (in total 2887), 1102 states have internal predecessors, (2887), 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:03,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 2887 transitions. [2025-04-26 16:22:03,124 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1103 states and 2887 transitions. [2025-04-26 16:22:03,124 INFO L438 stractBuchiCegarLoop]: Abstraction has 1103 states and 2887 transitions. [2025-04-26 16:22:03,124 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:22:03,124 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1103 states and 2887 transitions. [2025-04-26 16:22:03,128 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:22:03,128 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:03,128 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:03,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:03,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:03,129 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:03,129 INFO L754 eck$LassoCheckResult]: Loop: "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" [2025-04-26 16:22:03,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:03,129 INFO L85 PathProgramCache]: Analyzing trace with hash 673234287, now seen corresponding path program 1 times [2025-04-26 16:22:03,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:03,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123153884] [2025-04-26 16:22:03,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:03,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:03,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:03,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:03,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:03,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:03,132 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:03,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:03,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:03,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:03,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:03,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:03,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:03,136 INFO L85 PathProgramCache]: Analyzing trace with hash -712911557, now seen corresponding path program 4 times [2025-04-26 16:22:03,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:03,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83963985] [2025-04-26 16:22:03,136 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:03,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:03,137 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:22:03,138 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:03,139 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:03,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:03,139 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:03,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:03,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:03,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:03,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:03,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:03,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:03,142 INFO L85 PathProgramCache]: Analyzing trace with hash 419251369, now seen corresponding path program 2 times [2025-04-26 16:22:03,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:03,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993018281] [2025-04-26 16:22:03,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:03,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:03,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:22:03,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:22:03,149 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:03,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:03,149 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:03,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:22:03,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:22:03,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:03,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:03,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:03,299 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:03,299 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:03,299 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:03,299 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:03,299 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:03,299 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:03,299 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:03,299 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:03,299 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration8_Lasso [2025-04-26 16:22:03,299 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:03,299 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:03,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:03,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:03,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:03,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:03,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:03,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:03,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:03,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:03,564 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:03,565 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:03,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:03,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:03,575 INFO L229 MonitoredProcess]: Starting monitored process 206 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:03,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2025-04-26 16:22:03,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:22:03,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:03,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:03,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:03,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:03,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:03,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:03,590 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:03,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:03,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:03,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:03,597 INFO L229 MonitoredProcess]: Starting monitored process 207 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:03,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2025-04-26 16:22:03,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:03,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:03,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:03,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:03,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:03,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:03,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:03,612 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:03,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Ended with exit code 0 [2025-04-26 16:22:03,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:03,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:03,644 INFO L229 MonitoredProcess]: Starting monitored process 208 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:03,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2025-04-26 16:22:03,645 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:03,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:03,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:03,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:03,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:03,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:03,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:03,658 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:03,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Ended with exit code 0 [2025-04-26 16:22:03,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:03,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:03,665 INFO L229 MonitoredProcess]: Starting monitored process 209 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:03,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2025-04-26 16:22:03,666 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:03,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:03,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:03,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:03,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:03,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:03,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:03,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:03,677 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:03,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:03,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:03,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:03,713 INFO L229 MonitoredProcess]: Starting monitored process 210 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:03,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Waiting until timeout for monitored process [2025-04-26 16:22:03,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:03,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:03,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:03,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:03,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:03,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:03,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:03,732 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:03,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Ended with exit code 0 [2025-04-26 16:22:03,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:03,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:03,739 INFO L229 MonitoredProcess]: Starting monitored process 211 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:03,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Waiting until timeout for monitored process [2025-04-26 16:22:03,741 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:03,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:03,750 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:03,750 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:03,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:03,757 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:22:03,757 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:03,774 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:03,802 INFO L436 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2025-04-26 16:22:03,803 INFO L437 ModelExtractionUtils]: 9 out of 26 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-04-26 16:22:03,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:03,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:03,804 INFO L229 MonitoredProcess]: Starting monitored process 212 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:03,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2025-04-26 16:22:03,806 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:03,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:03,822 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:03,822 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:03,822 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerWithAssertThread1of1ForFork0_steal_x#1, N) = 2*workerWithAssertThread1of1ForFork0_steal_x#1 + 1*N Supporting invariants [3*cnt - 5*N + 2 >= 0] [2025-04-26 16:22:03,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Ended with exit code 0 [2025-04-26 16:22:03,830 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:03,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:03,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:03,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:03,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:03,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:03,849 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-26 16:22:03,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:04,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:04,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:04,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:04,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:04,025 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:04,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:04,100 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:04,100 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 5 loop predicates [2025-04-26 16:22:04,100 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1103 states and 2887 transitions. cyclomatic complexity: 1841 Second operand has 12 states, 12 states have (on average 1.75) internal successors, (in total 21), 11 states have internal predecessors, (21), 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:04,432 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1103 states and 2887 transitions. cyclomatic complexity: 1841. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (in total 21), 11 states have internal predecessors, (21), 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 1810 states and 4549 transitions. Complement of second has 23 states. [2025-04-26 16:22:04,432 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 8 stem states 6 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (in total 21), 11 states have internal predecessors, (21), 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:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 128 transitions. [2025-04-26 16:22:04,433 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 16 states and 128 transitions. Stem has 13 letters. Loop has 8 letters. [2025-04-26 16:22:04,433 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:04,433 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 16 states and 128 transitions. Stem has 21 letters. Loop has 8 letters. [2025-04-26 16:22:04,433 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:04,433 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 16 states and 128 transitions. Stem has 13 letters. Loop has 16 letters. [2025-04-26 16:22:04,433 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:04,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1810 states and 4549 transitions. [2025-04-26 16:22:04,445 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2025-04-26 16:22:04,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1810 states to 1712 states and 4323 transitions. [2025-04-26 16:22:04,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 991 [2025-04-26 16:22:04,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1049 [2025-04-26 16:22:04,466 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1712 states and 4323 transitions. [2025-04-26 16:22:04,467 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:04,467 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1712 states and 4323 transitions. [2025-04-26 16:22:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states and 4323 transitions. [2025-04-26 16:22:04,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1126. [2025-04-26 16:22:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 1126 states have (on average 2.6234458259325044) internal successors, (in total 2954), 1125 states have internal predecessors, (2954), 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:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 2954 transitions. [2025-04-26 16:22:04,486 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1126 states and 2954 transitions. [2025-04-26 16:22:04,486 INFO L438 stractBuchiCegarLoop]: Abstraction has 1126 states and 2954 transitions. [2025-04-26 16:22:04,486 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:22:04,486 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1126 states and 2954 transitions. [2025-04-26 16:22:04,490 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:22:04,490 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:04,490 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:04,491 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:04,491 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:04,491 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:04,491 INFO L754 eck$LassoCheckResult]: Loop: "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" [2025-04-26 16:22:04,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:04,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1237347635, now seen corresponding path program 2 times [2025-04-26 16:22:04,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:04,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607632595] [2025-04-26 16:22:04,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:04,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:04,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:04,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:04,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:04,495 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:04,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:04,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:04,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:04,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:04,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:04,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:04,498 INFO L85 PathProgramCache]: Analyzing trace with hash -712911557, now seen corresponding path program 5 times [2025-04-26 16:22:04,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:04,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798383153] [2025-04-26 16:22:04,498 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:04,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:04,500 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:04,501 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:04,501 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:04,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:04,501 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:04,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:04,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:04,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:04,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:04,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:04,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:04,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2011361389, now seen corresponding path program 3 times [2025-04-26 16:22:04,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:04,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416784730] [2025-04-26 16:22:04,504 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:04,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:04,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:22:04,509 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:22:04,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:04,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:04,509 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:04,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:22:04,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:22:04,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:04,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:04,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:04,641 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:04,641 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:04,641 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:04,641 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:04,641 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:04,641 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:04,641 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:04,641 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:04,641 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration9_Lasso [2025-04-26 16:22:04,641 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:04,641 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:04,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:04,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:04,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:04,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:04,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:04,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:04,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:04,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:04,885 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:04,885 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:04,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:04,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:04,887 INFO L229 MonitoredProcess]: Starting monitored process 213 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:04,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2025-04-26 16:22:04,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:22:04,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:04,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:04,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:04,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:04,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:04,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:04,902 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:04,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Ended with exit code 0 [2025-04-26 16:22:04,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:04,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:04,909 INFO L229 MonitoredProcess]: Starting monitored process 214 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:04,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2025-04-26 16:22:04,911 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:04,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:04,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:04,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:04,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:04,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:04,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:04,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:04,922 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:04,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Ended with exit code 0 [2025-04-26 16:22:04,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:04,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:04,929 INFO L229 MonitoredProcess]: Starting monitored process 215 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:04,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2025-04-26 16:22:04,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:22:04,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:04,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:04,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:04,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:04,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:04,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:04,943 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:04,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Ended with exit code 0 [2025-04-26 16:22:04,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:04,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:04,951 INFO L229 MonitoredProcess]: Starting monitored process 216 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:04,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Waiting until timeout for monitored process [2025-04-26 16:22:04,953 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:04,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:04,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:04,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:04,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:04,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:04,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:04,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:04,964 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:04,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Ended with exit code 0 [2025-04-26 16:22:04,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:04,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:04,972 INFO L229 MonitoredProcess]: Starting monitored process 217 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:04,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Waiting until timeout for monitored process [2025-04-26 16:22:04,974 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:04,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:04,984 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:04,984 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:04,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:04,991 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:22:04,991 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:05,014 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:05,037 INFO L436 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-04-26 16:22:05,037 INFO L437 ModelExtractionUtils]: 10 out of 26 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-04-26 16:22:05,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:05,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:05,039 INFO L229 MonitoredProcess]: Starting monitored process 218 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:05,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Waiting until timeout for monitored process [2025-04-26 16:22:05,041 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:05,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Ended with exit code 0 [2025-04-26 16:22:05,057 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:05,057 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:05,058 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerWithAssertThread1of1ForFork0_steal_x#1) = 2*workerWithAssertThread1of1ForFork0_steal_x#1 + 1 Supporting invariants [1*cnt - 2*N + 1 >= 0] [2025-04-26 16:22:05,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Ended with exit code 0 [2025-04-26 16:22:05,066 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:05,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:05,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:05,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:05,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:05,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:05,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-26 16:22:05,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:05,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:05,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:05,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:05,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:05,331 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:05,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:05,401 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:05,401 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 5 loop predicates [2025-04-26 16:22:05,401 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1126 states and 2954 transitions. cyclomatic complexity: 1885 Second operand has 12 states, 12 states have (on average 1.75) internal successors, (in total 21), 11 states have internal predecessors, (21), 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:05,787 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1126 states and 2954 transitions. cyclomatic complexity: 1885. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (in total 21), 11 states have internal predecessors, (21), 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 1801 states and 4541 transitions. Complement of second has 23 states. [2025-04-26 16:22:05,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 8 stem states 6 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (in total 21), 11 states have internal predecessors, (21), 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:05,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2025-04-26 16:22:05,788 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 16 states and 127 transitions. Stem has 13 letters. Loop has 8 letters. [2025-04-26 16:22:05,788 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:05,788 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 16 states and 127 transitions. Stem has 21 letters. Loop has 8 letters. [2025-04-26 16:22:05,788 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:05,788 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 16 states and 127 transitions. Stem has 13 letters. Loop has 16 letters. [2025-04-26 16:22:05,788 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:05,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1801 states and 4541 transitions. [2025-04-26 16:22:05,798 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2025-04-26 16:22:05,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1801 states to 1703 states and 4315 transitions. [2025-04-26 16:22:05,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 991 [2025-04-26 16:22:05,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1049 [2025-04-26 16:22:05,808 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1703 states and 4315 transitions. [2025-04-26 16:22:05,808 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:05,808 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1703 states and 4315 transitions. [2025-04-26 16:22:05,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states and 4315 transitions. [2025-04-26 16:22:05,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1116. [2025-04-26 16:22:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1116 states have (on average 2.6245519713261647) internal successors, (in total 2929), 1115 states have internal predecessors, (2929), 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:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 2929 transitions. [2025-04-26 16:22:05,829 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1116 states and 2929 transitions. [2025-04-26 16:22:05,829 INFO L438 stractBuchiCegarLoop]: Abstraction has 1116 states and 2929 transitions. [2025-04-26 16:22:05,829 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:22:05,829 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1116 states and 2929 transitions. [2025-04-26 16:22:05,832 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:22:05,832 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:05,832 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:05,833 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:05,833 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:05,833 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:05,834 INFO L754 eck$LassoCheckResult]: Loop: "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" [2025-04-26 16:22:05,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:05,834 INFO L85 PathProgramCache]: Analyzing trace with hash 999537971, now seen corresponding path program 3 times [2025-04-26 16:22:05,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:05,834 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116393044] [2025-04-26 16:22:05,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:05,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:05,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:05,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:05,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:05,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:05,838 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:05,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:05,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:05,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:05,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:05,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:05,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:05,842 INFO L85 PathProgramCache]: Analyzing trace with hash -712911557, now seen corresponding path program 6 times [2025-04-26 16:22:05,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:05,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78837842] [2025-04-26 16:22:05,842 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:05,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:05,844 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:05,845 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:05,845 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:05,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:05,845 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:05,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:05,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:05,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:05,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:05,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:05,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:05,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1231437933, now seen corresponding path program 4 times [2025-04-26 16:22:05,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:05,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901978290] [2025-04-26 16:22:05,851 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:05,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:05,853 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-26 16:22:05,855 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:22:05,855 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:05,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:05,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:05,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:22:05,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:22:05,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:05,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:05,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:06,010 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:06,011 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:06,011 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:06,011 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:06,011 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:06,011 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:06,011 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:06,011 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:06,011 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration10_Lasso [2025-04-26 16:22:06,011 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:06,011 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:06,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:06,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:06,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:06,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:06,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:06,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:06,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:06,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:06,297 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:06,298 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:06,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:06,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:06,299 INFO L229 MonitoredProcess]: Starting monitored process 219 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:06,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Waiting until timeout for monitored process [2025-04-26 16:22:06,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:22:06,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:06,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:06,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:06,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:06,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:06,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:06,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:06,312 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:06,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Ended with exit code 0 [2025-04-26 16:22:06,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:06,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:06,319 INFO L229 MonitoredProcess]: Starting monitored process 220 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:06,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Waiting until timeout for monitored process [2025-04-26 16:22:06,320 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:06,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:06,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:06,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:06,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:06,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:06,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:06,333 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:06,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Ended with exit code 0 [2025-04-26 16:22:06,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:06,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:06,340 INFO L229 MonitoredProcess]: Starting monitored process 221 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:06,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Waiting until timeout for monitored process [2025-04-26 16:22:06,341 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:06,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:06,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:06,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:06,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:06,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:06,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:06,354 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:06,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Ended with exit code 0 [2025-04-26 16:22:06,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:06,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:06,360 INFO L229 MonitoredProcess]: Starting monitored process 222 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:06,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Waiting until timeout for monitored process [2025-04-26 16:22:06,362 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:06,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:06,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:06,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:06,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:06,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:06,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:06,374 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:06,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Ended with exit code 0 [2025-04-26 16:22:06,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:06,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:06,381 INFO L229 MonitoredProcess]: Starting monitored process 223 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:06,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Waiting until timeout for monitored process [2025-04-26 16:22:06,383 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:06,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:06,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:06,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:06,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:06,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:06,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:06,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:06,393 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:06,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:06,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:06,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:06,400 INFO L229 MonitoredProcess]: Starting monitored process 224 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:06,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Waiting until timeout for monitored process [2025-04-26 16:22:06,402 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:06,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:06,412 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:06,412 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:06,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:06,418 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:22:06,418 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:06,435 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:06,459 INFO L436 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-04-26 16:22:06,460 INFO L437 ModelExtractionUtils]: 12 out of 26 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-04-26 16:22:06,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:06,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:06,461 INFO L229 MonitoredProcess]: Starting monitored process 225 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:06,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Waiting until timeout for monitored process [2025-04-26 16:22:06,463 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:06,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Ended with exit code 0 [2025-04-26 16:22:06,479 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:06,479 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:06,479 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerWithAssertThread1of1ForFork0_steal_x#1) = 1*N + 2*workerWithAssertThread1of1ForFork0_steal_x#1 Supporting invariants [1*cnt - 2*N + 1 >= 0] [2025-04-26 16:22:06,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Ended with exit code 0 [2025-04-26 16:22:06,487 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:06,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:06,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:06,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:06,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:06,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:06,511 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-26 16:22:06,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:06,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:06,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:06,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:06,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:06,685 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:06,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:06,746 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:06,747 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 5 loop predicates [2025-04-26 16:22:06,747 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1116 states and 2929 transitions. cyclomatic complexity: 1870 Second operand has 12 states, 12 states have (on average 1.75) internal successors, (in total 21), 11 states have internal predecessors, (21), 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:07,049 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1116 states and 2929 transitions. cyclomatic complexity: 1870. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (in total 21), 11 states have internal predecessors, (21), 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 1962 states and 4901 transitions. Complement of second has 23 states. [2025-04-26 16:22:07,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 8 stem states 6 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:07,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (in total 21), 11 states have internal predecessors, (21), 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:07,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 135 transitions. [2025-04-26 16:22:07,052 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 16 states and 135 transitions. Stem has 13 letters. Loop has 8 letters. [2025-04-26 16:22:07,052 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:07,052 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 16 states and 135 transitions. Stem has 21 letters. Loop has 8 letters. [2025-04-26 16:22:07,052 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:07,052 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 16 states and 135 transitions. Stem has 13 letters. Loop has 16 letters. [2025-04-26 16:22:07,052 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:07,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1962 states and 4901 transitions. [2025-04-26 16:22:07,061 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2025-04-26 16:22:07,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1962 states to 1864 states and 4675 transitions. [2025-04-26 16:22:07,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1066 [2025-04-26 16:22:07,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1124 [2025-04-26 16:22:07,071 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1864 states and 4675 transitions. [2025-04-26 16:22:07,083 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:07,083 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1864 states and 4675 transitions. [2025-04-26 16:22:07,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states and 4675 transitions. [2025-04-26 16:22:07,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1119. [2025-04-26 16:22:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 1119 states have (on average 2.623771224307417) internal successors, (in total 2936), 1118 states have internal predecessors, (2936), 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:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 2936 transitions. [2025-04-26 16:22:07,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1119 states and 2936 transitions. [2025-04-26 16:22:07,101 INFO L438 stractBuchiCegarLoop]: Abstraction has 1119 states and 2936 transitions. [2025-04-26 16:22:07,101 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:22:07,101 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1119 states and 2936 transitions. [2025-04-26 16:22:07,104 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:22:07,104 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:07,104 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:07,104 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:07,104 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:07,105 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[107] L41-->L42: Formula: (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:07,105 INFO L754 eck$LassoCheckResult]: Loop: "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" [2025-04-26 16:22:07,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:07,105 INFO L85 PathProgramCache]: Analyzing trace with hash -705574340, now seen corresponding path program 1 times [2025-04-26 16:22:07,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:07,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922738149] [2025-04-26 16:22:07,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:07,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:07,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:07,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:07,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:07,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:07,112 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:07,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:07,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:07,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:07,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:07,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:07,116 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:07,116 INFO L85 PathProgramCache]: Analyzing trace with hash 392240871, now seen corresponding path program 5 times [2025-04-26 16:22:07,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:07,116 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589856853] [2025-04-26 16:22:07,116 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:07,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:07,118 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:07,120 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:07,120 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:07,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:07,120 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:07,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:07,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:07,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:07,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:07,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:07,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:07,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1750172126, now seen corresponding path program 1 times [2025-04-26 16:22:07,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:07,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113320017] [2025-04-26 16:22:07,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:07,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:07,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:22:07,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:22:07,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:07,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:07,130 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:07,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:22:07,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:22:07,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:07,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:07,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:07,267 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:07,268 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:07,268 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:07,268 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:07,268 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:07,268 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:07,268 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:07,268 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:07,268 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration11_Lasso [2025-04-26 16:22:07,268 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:07,268 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:07,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:07,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:07,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:07,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:07,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:07,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:07,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:07,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:07,546 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:07,547 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:07,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:07,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:07,548 INFO L229 MonitoredProcess]: Starting monitored process 226 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:07,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Waiting until timeout for monitored process [2025-04-26 16:22:07,550 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:07,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:07,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:07,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:07,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:07,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:07,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:07,562 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:07,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Ended with exit code 0 [2025-04-26 16:22:07,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:07,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:07,569 INFO L229 MonitoredProcess]: Starting monitored process 227 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:07,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Waiting until timeout for monitored process [2025-04-26 16:22:07,576 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:07,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:07,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:07,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:07,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:07,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:07,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:07,589 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:07,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Ended with exit code 0 [2025-04-26 16:22:07,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:07,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:07,596 INFO L229 MonitoredProcess]: Starting monitored process 228 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:07,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Waiting until timeout for monitored process [2025-04-26 16:22:07,598 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:07,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:07,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:07,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:07,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:07,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:07,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:07,611 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:07,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:07,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:07,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:07,618 INFO L229 MonitoredProcess]: Starting monitored process 229 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:07,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Waiting until timeout for monitored process [2025-04-26 16:22:07,620 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:07,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:07,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:07,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:07,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:07,630 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:07,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:07,632 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:07,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:07,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:07,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:07,639 INFO L229 MonitoredProcess]: Starting monitored process 230 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:07,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Waiting until timeout for monitored process [2025-04-26 16:22:07,641 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:07,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:07,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:07,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:07,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:07,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:07,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:07,654 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:07,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:07,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:07,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:07,661 INFO L229 MonitoredProcess]: Starting monitored process 231 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:07,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Waiting until timeout for monitored process [2025-04-26 16:22:07,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:07,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:07,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:07,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:07,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:07,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:07,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:07,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:07,673 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:07,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Ended with exit code 0 [2025-04-26 16:22:07,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:07,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:07,681 INFO L229 MonitoredProcess]: Starting monitored process 232 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:07,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Waiting until timeout for monitored process [2025-04-26 16:22:07,682 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:07,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:07,692 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:07,692 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:07,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:07,699 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:22:07,699 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:07,716 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:07,732 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:22:07,732 INFO L437 ModelExtractionUtils]: 12 out of 26 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:22:07,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:07,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:07,734 INFO L229 MonitoredProcess]: Starting monitored process 233 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:07,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Waiting until timeout for monitored process [2025-04-26 16:22:07,735 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:07,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:07,752 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 4. [2025-04-26 16:22:07,752 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:07,752 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerThread1of1ForFork1_i#1, cnt) = 2*workerThread1of1ForFork1_i#1 + 1*cnt Supporting invariants [3*cnt - 5*N + 2 >= 0, 2*cnt - 1*N >= 0] [2025-04-26 16:22:07,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Ended with exit code 0 [2025-04-26 16:22:07,762 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:22:07,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:07,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:07,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:07,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:07,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:07,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-26 16:22:07,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:07,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:07,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:07,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:07,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:07,943 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:07,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:08,032 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:08,033 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 5 loop predicates [2025-04-26 16:22:08,033 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1119 states and 2936 transitions. cyclomatic complexity: 1874 Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (in total 22), 12 states have internal predecessors, (22), 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:08,280 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1119 states and 2936 transitions. cyclomatic complexity: 1874. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (in total 22), 12 states have internal predecessors, (22), 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 1829 states and 4635 transitions. Complement of second has 21 states. [2025-04-26 16:22:08,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 8 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:08,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (in total 22), 12 states have internal predecessors, (22), 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:08,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 123 transitions. [2025-04-26 16:22:08,281 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 123 transitions. Stem has 14 letters. Loop has 8 letters. [2025-04-26 16:22:08,281 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:08,281 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 123 transitions. Stem has 22 letters. Loop has 8 letters. [2025-04-26 16:22:08,281 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:08,281 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 123 transitions. Stem has 14 letters. Loop has 16 letters. [2025-04-26 16:22:08,281 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:08,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1829 states and 4635 transitions. [2025-04-26 16:22:08,287 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:22:08,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1829 states to 1727 states and 4395 transitions. [2025-04-26 16:22:08,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 913 [2025-04-26 16:22:08,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 960 [2025-04-26 16:22:08,296 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1727 states and 4395 transitions. [2025-04-26 16:22:08,296 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:08,296 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1727 states and 4395 transitions. [2025-04-26 16:22:08,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states and 4395 transitions. [2025-04-26 16:22:08,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1169. [2025-04-26 16:22:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 1169 states have (on average 2.6372968349016253) internal successors, (in total 3083), 1168 states have internal predecessors, (3083), 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:08,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 3083 transitions. [2025-04-26 16:22:08,313 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1169 states and 3083 transitions. [2025-04-26 16:22:08,314 INFO L438 stractBuchiCegarLoop]: Abstraction has 1169 states and 3083 transitions. [2025-04-26 16:22:08,314 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 16:22:08,314 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1169 states and 3083 transitions. [2025-04-26 16:22:08,316 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:22:08,316 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:08,316 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:08,317 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:08,317 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:08,317 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[107] L41-->L42: Formula: (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:08,317 INFO L754 eck$LassoCheckResult]: Loop: "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" [2025-04-26 16:22:08,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:08,318 INFO L85 PathProgramCache]: Analyzing trace with hash 94430236, now seen corresponding path program 2 times [2025-04-26 16:22:08,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:08,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251931248] [2025-04-26 16:22:08,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:08,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:08,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:08,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:08,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:08,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,322 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:08,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:08,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:08,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:08,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:08,328 INFO L85 PathProgramCache]: Analyzing trace with hash 392240871, now seen corresponding path program 6 times [2025-04-26 16:22:08,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:08,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665913187] [2025-04-26 16:22:08,328 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:08,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:08,330 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:08,331 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:08,331 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:08,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,332 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:08,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:08,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:08,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:08,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:08,338 INFO L85 PathProgramCache]: Analyzing trace with hash 320190466, now seen corresponding path program 2 times [2025-04-26 16:22:08,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:08,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351920544] [2025-04-26 16:22:08,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:08,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:08,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:22:08,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:22:08,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:08,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,343 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:08,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:22:08,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:22:08,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:08,495 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:08,495 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:08,495 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:08,495 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:08,495 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:08,495 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:08,495 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:08,495 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:08,495 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration12_Lasso [2025-04-26 16:22:08,495 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:08,495 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:08,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:08,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:08,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:08,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:08,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:08,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:08,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:08,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:08,735 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:08,736 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:08,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:08,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:08,737 INFO L229 MonitoredProcess]: Starting monitored process 234 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:08,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Waiting until timeout for monitored process [2025-04-26 16:22:08,739 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:08,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:08,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:08,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:08,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:08,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:08,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:08,751 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:08,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:08,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:08,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:08,758 INFO L229 MonitoredProcess]: Starting monitored process 235 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:08,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Waiting until timeout for monitored process [2025-04-26 16:22:08,760 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:08,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:08,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:08,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:08,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:08,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:08,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:08,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:08,771 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:08,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Ended with exit code 0 [2025-04-26 16:22:08,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:08,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:08,778 INFO L229 MonitoredProcess]: Starting monitored process 236 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:08,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Waiting until timeout for monitored process [2025-04-26 16:22:08,779 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:08,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:08,789 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:08,789 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:08,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:08,797 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:22:08,798 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:08,816 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:08,832 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:22:08,832 INFO L437 ModelExtractionUtils]: 14 out of 26 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:22:08,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:08,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:08,834 INFO L229 MonitoredProcess]: Starting monitored process 237 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:08,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Waiting until timeout for monitored process [2025-04-26 16:22:08,835 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:08,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Ended with exit code 0 [2025-04-26 16:22:08,852 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:08,852 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:08,852 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerThread1of1ForFork1_i#1) = 1*N + 2*workerThread1of1ForFork1_i#1 Supporting invariants [2*cnt - 5*N + 3 >= 0] [2025-04-26 16:22:08,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Ended with exit code 0 [2025-04-26 16:22:08,861 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:08,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:08,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:08,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:08,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:08,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-26 16:22:08,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:09,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:09,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:09,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:09,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:09,075 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:09,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:09,171 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:09,171 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 5 loop predicates [2025-04-26 16:22:09,172 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1169 states and 3083 transitions. cyclomatic complexity: 1971 Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (in total 22), 12 states have internal predecessors, (22), 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:09,442 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1169 states and 3083 transitions. cyclomatic complexity: 1971. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (in total 22), 12 states have internal predecessors, (22), 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 1925 states and 4873 transitions. Complement of second has 21 states. [2025-04-26 16:22:09,442 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 8 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (in total 22), 12 states have internal predecessors, (22), 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:09,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 128 transitions. [2025-04-26 16:22:09,443 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 128 transitions. Stem has 14 letters. Loop has 8 letters. [2025-04-26 16:22:09,443 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:09,443 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 128 transitions. Stem has 22 letters. Loop has 8 letters. [2025-04-26 16:22:09,443 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:09,443 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 128 transitions. Stem has 14 letters. Loop has 16 letters. [2025-04-26 16:22:09,443 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:09,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1925 states and 4873 transitions. [2025-04-26 16:22:09,450 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:22:09,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1925 states to 1823 states and 4633 transitions. [2025-04-26 16:22:09,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 981 [2025-04-26 16:22:09,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1028 [2025-04-26 16:22:09,458 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1823 states and 4633 transitions. [2025-04-26 16:22:09,458 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:09,458 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1823 states and 4633 transitions. [2025-04-26 16:22:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states and 4633 transitions. [2025-04-26 16:22:09,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1177. [2025-04-26 16:22:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1177 states have (on average 2.6363636363636362) internal successors, (in total 3103), 1176 states have internal predecessors, (3103), 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:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 3103 transitions. [2025-04-26 16:22:09,487 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1177 states and 3103 transitions. [2025-04-26 16:22:09,487 INFO L438 stractBuchiCegarLoop]: Abstraction has 1177 states and 3103 transitions. [2025-04-26 16:22:09,487 INFO L340 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-04-26 16:22:09,487 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1177 states and 3103 transitions. [2025-04-26 16:22:09,489 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:22:09,489 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:09,489 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:09,491 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:09,491 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:09,492 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:09,492 INFO L754 eck$LassoCheckResult]: Loop: "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" [2025-04-26 16:22:09,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:09,493 INFO L85 PathProgramCache]: Analyzing trace with hash -604573898, now seen corresponding path program 1 times [2025-04-26 16:22:09,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:09,493 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630245023] [2025-04-26 16:22:09,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:09,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:09,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:09,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:09,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:09,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:09,496 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:09,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:09,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:09,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:09,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:09,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:09,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:09,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1432205049, now seen corresponding path program 7 times [2025-04-26 16:22:09,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:09,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499863847] [2025-04-26 16:22:09,500 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:09,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:09,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:09,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:09,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:09,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:09,503 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:09,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:09,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:09,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:09,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:09,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:09,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:09,506 INFO L85 PathProgramCache]: Analyzing trace with hash -966446276, now seen corresponding path program 5 times [2025-04-26 16:22:09,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:09,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744440311] [2025-04-26 16:22:09,506 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:09,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:09,508 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:22:09,510 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:22:09,510 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:09,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:09,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:09,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:22:09,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:22:09,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:09,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:09,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:09,659 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:09,659 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:09,659 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:09,659 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:09,659 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:09,659 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:09,659 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:09,659 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:09,659 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration13_Lasso [2025-04-26 16:22:09,659 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:09,659 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:09,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,924 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:09,925 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:09,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:09,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:09,926 INFO L229 MonitoredProcess]: Starting monitored process 238 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:09,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Waiting until timeout for monitored process [2025-04-26 16:22:09,928 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:09,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:09,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:09,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:09,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:09,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:09,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:09,940 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:09,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Ended with exit code 0 [2025-04-26 16:22:09,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:09,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:09,947 INFO L229 MonitoredProcess]: Starting monitored process 239 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:09,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Waiting until timeout for monitored process [2025-04-26 16:22:09,949 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:09,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:09,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:09,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:09,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:09,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:09,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:09,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:09,959 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:09,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Ended with exit code 0 [2025-04-26 16:22:09,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:09,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:09,967 INFO L229 MonitoredProcess]: Starting monitored process 240 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:09,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Waiting until timeout for monitored process [2025-04-26 16:22:09,973 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:09,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:09,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:09,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:09,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:09,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:09,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:09,986 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:09,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Ended with exit code 0 [2025-04-26 16:22:09,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:09,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:09,993 INFO L229 MonitoredProcess]: Starting monitored process 241 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:09,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Waiting until timeout for monitored process [2025-04-26 16:22:09,995 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:10,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:10,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:10,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:10,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:10,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:10,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:10,008 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:10,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Ended with exit code 0 [2025-04-26 16:22:10,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:10,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:10,017 INFO L229 MonitoredProcess]: Starting monitored process 242 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:10,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Waiting until timeout for monitored process [2025-04-26 16:22:10,019 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:10,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:10,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:10,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:10,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:10,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:10,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:10,031 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:10,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Ended with exit code 0 [2025-04-26 16:22:10,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:10,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:10,039 INFO L229 MonitoredProcess]: Starting monitored process 243 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:10,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Waiting until timeout for monitored process [2025-04-26 16:22:10,041 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:10,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:10,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:10,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:10,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:10,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:10,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:10,053 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:10,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:10,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:10,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:10,060 INFO L229 MonitoredProcess]: Starting monitored process 244 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:10,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Waiting until timeout for monitored process [2025-04-26 16:22: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:22:10,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:10,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:10,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:10,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:10,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:10,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:10,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:10,074 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:10,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:10,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:10,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:10,081 INFO L229 MonitoredProcess]: Starting monitored process 245 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:10,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Waiting until timeout for monitored process [2025-04-26 16:22:10,082 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:10,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:10,092 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:10,093 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:10,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:10,100 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:22:10,100 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:10,121 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:10,135 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:22:10,135 INFO L437 ModelExtractionUtils]: 14 out of 26 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:22:10,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:10,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:10,137 INFO L229 MonitoredProcess]: Starting monitored process 246 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:10,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Waiting until timeout for monitored process [2025-04-26 16:22:10,138 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:10,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Ended with exit code 0 [2025-04-26 16:22:10,156 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:10,156 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:10,156 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerWithAssertThread1of1ForFork0_i#1, N) = 2*workerWithAssertThread1of1ForFork0_i#1 + 1*N Supporting invariants [-5*N + 2*cnt + 3 >= 0] [2025-04-26 16:22:10,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Ended with exit code 0 [2025-04-26 16:22:10,165 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:10,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:10,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:10,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:10,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:10,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:10,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-26 16:22:10,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:10,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:10,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:10,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:10,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:10,374 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:10,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:10,466 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:10,467 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 5 loop predicates [2025-04-26 16:22:10,467 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1177 states and 3103 transitions. cyclomatic complexity: 1983 Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (in total 22), 12 states have internal predecessors, (22), 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:10,725 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1177 states and 3103 transitions. cyclomatic complexity: 1983. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (in total 22), 12 states have internal predecessors, (22), 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 1850 states and 4690 transitions. Complement of second has 21 states. [2025-04-26 16:22:10,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 8 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (in total 22), 12 states have internal predecessors, (22), 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:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 125 transitions. [2025-04-26 16:22:10,726 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 125 transitions. Stem has 14 letters. Loop has 8 letters. [2025-04-26 16:22:10,726 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:10,727 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 125 transitions. Stem has 22 letters. Loop has 8 letters. [2025-04-26 16:22:10,727 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:10,727 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 125 transitions. Stem has 14 letters. Loop has 16 letters. [2025-04-26 16:22:10,727 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:10,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1850 states and 4690 transitions. [2025-04-26 16:22:10,733 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2025-04-26 16:22:10,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1850 states to 1748 states and 4450 transitions. [2025-04-26 16:22:10,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1036 [2025-04-26 16:22:10,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1083 [2025-04-26 16:22:10,746 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1748 states and 4450 transitions. [2025-04-26 16:22:10,746 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:10,746 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1748 states and 4450 transitions. [2025-04-26 16:22:10,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states and 4450 transitions. [2025-04-26 16:22:10,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1257. [2025-04-26 16:22:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1257 states have (on average 2.6388225934765313) internal successors, (in total 3317), 1256 states have internal predecessors, (3317), 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:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 3317 transitions. [2025-04-26 16:22:10,762 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1257 states and 3317 transitions. [2025-04-26 16:22:10,762 INFO L438 stractBuchiCegarLoop]: Abstraction has 1257 states and 3317 transitions. [2025-04-26 16:22:10,762 INFO L340 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-04-26 16:22:10,762 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1257 states and 3317 transitions. [2025-04-26 16:22:10,765 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:22:10,765 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:10,765 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:10,765 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:10,765 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:10,765 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[107] L41-->L42: Formula: (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:10,766 INFO L754 eck$LassoCheckResult]: Loop: "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" [2025-04-26 16:22:10,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:10,766 INFO L85 PathProgramCache]: Analyzing trace with hash -397929736, now seen corresponding path program 3 times [2025-04-26 16:22:10,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:10,766 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219646771] [2025-04-26 16:22:10,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:10,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:10,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:10,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:10,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:10,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:10,769 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:10,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:10,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:10,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:10,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:10,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:10,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:10,771 INFO L85 PathProgramCache]: Analyzing trace with hash 392240871, now seen corresponding path program 7 times [2025-04-26 16:22:10,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:10,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267493465] [2025-04-26 16:22:10,771 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:10,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:10,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:10,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:10,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:10,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:10,773 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:10,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:10,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:10,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:10,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:10,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:10,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:10,775 INFO L85 PathProgramCache]: Analyzing trace with hash 360598238, now seen corresponding path program 3 times [2025-04-26 16:22:10,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:10,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225382434] [2025-04-26 16:22:10,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:10,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:10,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:22:10,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:22:10,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:10,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:10,780 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:10,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:22:10,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:22:10,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:10,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:10,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:10,935 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:10,935 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:10,935 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:10,935 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:10,935 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:10,935 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:10,935 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:10,935 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:10,935 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration14_Lasso [2025-04-26 16:22:10,935 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:10,935 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:10,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:10,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:10,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:10,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:11,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:11,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:11,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:11,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:11,213 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:11,213 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:11,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:11,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:11,215 INFO L229 MonitoredProcess]: Starting monitored process 247 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:11,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (247)] Waiting until timeout for monitored process [2025-04-26 16:22:11,216 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:11,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:11,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:11,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:11,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:11,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:11,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:11,229 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:11,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (247)] Ended with exit code 0 [2025-04-26 16:22:11,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:11,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:11,236 INFO L229 MonitoredProcess]: Starting monitored process 248 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:11,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Waiting until timeout for monitored process [2025-04-26 16:22:11,238 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:11,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:11,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:11,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:11,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:11,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:11,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:11,250 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:11,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:11,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:11,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:11,258 INFO L229 MonitoredProcess]: Starting monitored process 249 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:11,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Waiting until timeout for monitored process [2025-04-26 16:22:11,259 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:11,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:11,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:11,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:11,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:11,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:11,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:11,272 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:11,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Ended with exit code 0 [2025-04-26 16:22:11,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:11,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:11,279 INFO L229 MonitoredProcess]: Starting monitored process 250 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:11,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Waiting until timeout for monitored process [2025-04-26 16:22:11,280 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:11,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:11,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:11,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:11,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:11,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:11,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:11,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:11,291 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:11,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:11,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:11,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:11,298 INFO L229 MonitoredProcess]: Starting monitored process 251 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:11,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Waiting until timeout for monitored process [2025-04-26 16:22:11,300 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:11,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:11,309 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:11,309 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:11,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:11,317 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:22:11,317 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:11,336 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:11,356 INFO L436 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-04-26 16:22:11,356 INFO L437 ModelExtractionUtils]: 11 out of 26 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:22:11,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:11,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:11,358 INFO L229 MonitoredProcess]: Starting monitored process 252 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:11,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Waiting until timeout for monitored process [2025-04-26 16:22:11,359 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:11,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Ended with exit code 0 [2025-04-26 16:22:11,376 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:11,376 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:11,376 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerThread1of1ForFork1_i#1) = 1*N + 2*workerThread1of1ForFork1_i#1 Supporting invariants [-2*N + 1*cnt + 1 >= 0] [2025-04-26 16:22:11,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Ended with exit code 0 [2025-04-26 16:22:11,385 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:11,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:11,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:11,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:11,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:11,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:11,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-26 16:22:11,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:11,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:11,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:11,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:11,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:11,568 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:11,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:11,646 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:11,646 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 5 loop predicates [2025-04-26 16:22:11,646 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1257 states and 3317 transitions. cyclomatic complexity: 2117 Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (in total 22), 12 states have internal predecessors, (22), 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:11,964 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1257 states and 3317 transitions. cyclomatic complexity: 2117. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (in total 22), 12 states have internal predecessors, (22), 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 1953 states and 4985 transitions. Complement of second has 21 states. [2025-04-26 16:22:11,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 8 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:11,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (in total 22), 12 states have internal predecessors, (22), 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:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 125 transitions. [2025-04-26 16:22:11,965 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 125 transitions. Stem has 14 letters. Loop has 8 letters. [2025-04-26 16:22:11,965 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:11,965 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 125 transitions. Stem has 22 letters. Loop has 8 letters. [2025-04-26 16:22:11,965 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:11,965 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 125 transitions. Stem has 14 letters. Loop has 16 letters. [2025-04-26 16:22:11,965 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:11,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1953 states and 4985 transitions. [2025-04-26 16:22:11,972 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:22:11,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1953 states to 1851 states and 4745 transitions. [2025-04-26 16:22:11,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1022 [2025-04-26 16:22:11,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1069 [2025-04-26 16:22:11,981 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1851 states and 4745 transitions. [2025-04-26 16:22:11,981 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:11,981 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1851 states and 4745 transitions. [2025-04-26 16:22:11,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states and 4745 transitions. [2025-04-26 16:22:11,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1253. [2025-04-26 16:22:11,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1253 states have (on average 2.6328810853950517) internal successors, (in total 3299), 1252 states have internal predecessors, (3299), 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:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 3299 transitions. [2025-04-26 16:22:11,999 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1253 states and 3299 transitions. [2025-04-26 16:22:11,999 INFO L438 stractBuchiCegarLoop]: Abstraction has 1253 states and 3299 transitions. [2025-04-26 16:22:11,999 INFO L340 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-04-26 16:22:11,999 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1253 states and 3299 transitions. [2025-04-26 16:22:12,003 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:22:12,003 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:12,003 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:12,003 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:12,003 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:12,003 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:12,004 INFO L754 eck$LassoCheckResult]: Loop: "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" [2025-04-26 16:22:12,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:12,004 INFO L85 PathProgramCache]: Analyzing trace with hash -296929294, now seen corresponding path program 2 times [2025-04-26 16:22:12,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:12,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082658690] [2025-04-26 16:22:12,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:12,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:12,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:12,007 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:12,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:12,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:12,007 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:12,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:12,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:12,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:12,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:12,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:12,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:12,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1432205049, now seen corresponding path program 8 times [2025-04-26 16:22:12,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:12,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793033537] [2025-04-26 16:22:12,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:12,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:12,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:12,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:12,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:12,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:12,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:12,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:12,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:12,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:12,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:12,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:12,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:12,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1144324088, now seen corresponding path program 6 times [2025-04-26 16:22:12,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:12,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618246270] [2025-04-26 16:22:12,016 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:12,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:12,018 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:22:12,019 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:22:12,019 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:12,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:12,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:12,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:22:12,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:22:12,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:12,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:12,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:12,205 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:12,206 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:12,206 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:12,206 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:12,206 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:12,206 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:12,206 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:12,206 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:12,206 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration15_Lasso [2025-04-26 16:22:12,206 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:12,206 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:12,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:12,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:12,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:12,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:12,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:12,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:12,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:12,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:12,490 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:12,490 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:12,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:12,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:12,492 INFO L229 MonitoredProcess]: Starting monitored process 253 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:12,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Waiting until timeout for monitored process [2025-04-26 16:22:12,494 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:12,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:12,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:12,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:12,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:12,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:12,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:12,507 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:12,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Ended with exit code 0 [2025-04-26 16:22:12,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:12,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:12,514 INFO L229 MonitoredProcess]: Starting monitored process 254 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:12,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Waiting until timeout for monitored process [2025-04-26 16:22:12,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:12,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:12,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:12,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:12,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:12,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:12,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:12,528 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:12,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Ended with exit code 0 [2025-04-26 16:22:12,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:12,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:12,536 INFO L229 MonitoredProcess]: Starting monitored process 255 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:12,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Waiting until timeout for monitored process [2025-04-26 16:22:12,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:22:12,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:12,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:12,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:12,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:12,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:12,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:12,550 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:12,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:12,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:12,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:12,557 INFO L229 MonitoredProcess]: Starting monitored process 256 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:12,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Waiting until timeout for monitored process [2025-04-26 16:22:12,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:12,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:12,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:12,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:12,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:12,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:12,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:12,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:12,571 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:12,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:12,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:12,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:12,578 INFO L229 MonitoredProcess]: Starting monitored process 257 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:12,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Waiting until timeout for monitored process [2025-04-26 16:22:12,580 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:12,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:12,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:12,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:12,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:12,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:12,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:12,592 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:12,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Ended with exit code 0 [2025-04-26 16:22:12,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:12,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:12,601 INFO L229 MonitoredProcess]: Starting monitored process 258 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:12,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Waiting until timeout for monitored process [2025-04-26 16:22:12,603 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:12,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:12,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:12,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:12,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:12,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:12,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:12,615 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:12,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Ended with exit code 0 [2025-04-26 16:22:12,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:12,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:12,623 INFO L229 MonitoredProcess]: Starting monitored process 259 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:12,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Waiting until timeout for monitored process [2025-04-26 16:22:12,624 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:12,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:12,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:12,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:12,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:12,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:12,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:12,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:12,635 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:12,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Ended with exit code 0 [2025-04-26 16:22:12,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:12,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:12,644 INFO L229 MonitoredProcess]: Starting monitored process 260 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:12,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Waiting until timeout for monitored process [2025-04-26 16:22:12,645 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:12,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:12,659 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:12,659 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:12,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:12,666 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:22:12,666 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:12,686 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:12,708 INFO L436 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2025-04-26 16:22:12,708 INFO L437 ModelExtractionUtils]: 10 out of 26 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:22:12,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:12,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:12,710 INFO L229 MonitoredProcess]: Starting monitored process 261 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:12,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Waiting until timeout for monitored process [2025-04-26 16:22:12,712 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:12,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Ended with exit code 0 [2025-04-26 16:22:12,728 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 4. [2025-04-26 16:22:12,728 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:12,728 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerWithAssertThread1of1ForFork0_i#1, cnt) = 2*workerWithAssertThread1of1ForFork0_i#1 + 1*cnt Supporting invariants [3*cnt - 5*N + 2 >= 0, -1*workerWithAssertThread1of1ForFork0_i#1 + 1*cnt - 1 >= 0] [2025-04-26 16:22:12,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Ended with exit code 0 [2025-04-26 16:22:12,738 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:22:12,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:12,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:12,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:12,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:12,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:12,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-26 16:22:12,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:12,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:12,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:12,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:12,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:12,947 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:12,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:13,061 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:13,062 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 5 loop predicates [2025-04-26 16:22:13,062 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1253 states and 3299 transitions. cyclomatic complexity: 2103 Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (in total 22), 12 states have internal predecessors, (22), 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:13,344 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1253 states and 3299 transitions. cyclomatic complexity: 2103. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (in total 22), 12 states have internal predecessors, (22), 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 1908 states and 4850 transitions. Complement of second has 21 states. [2025-04-26 16:22:13,344 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 8 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (in total 22), 12 states have internal predecessors, (22), 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:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 126 transitions. [2025-04-26 16:22:13,344 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 126 transitions. Stem has 14 letters. Loop has 8 letters. [2025-04-26 16:22:13,344 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:13,344 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 126 transitions. Stem has 22 letters. Loop has 8 letters. [2025-04-26 16:22:13,345 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:13,345 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 126 transitions. Stem has 14 letters. Loop has 16 letters. [2025-04-26 16:22:13,345 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:13,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1908 states and 4850 transitions. [2025-04-26 16:22:13,351 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2025-04-26 16:22:13,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1908 states to 1806 states and 4610 transitions. [2025-04-26 16:22:13,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1094 [2025-04-26 16:22:13,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1141 [2025-04-26 16:22:13,358 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1806 states and 4610 transitions. [2025-04-26 16:22:13,358 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:13,358 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1806 states and 4610 transitions. [2025-04-26 16:22:13,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states and 4610 transitions. [2025-04-26 16:22:13,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1247. [2025-04-26 16:22:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 1247 states have (on average 2.628708901363272) internal successors, (in total 3278), 1246 states have internal predecessors, (3278), 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:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 3278 transitions. [2025-04-26 16:22:13,374 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1247 states and 3278 transitions. [2025-04-26 16:22:13,374 INFO L438 stractBuchiCegarLoop]: Abstraction has 1247 states and 3278 transitions. [2025-04-26 16:22:13,374 INFO L340 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-04-26 16:22:13,374 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1247 states and 3278 transitions. [2025-04-26 16:22:13,377 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:22:13,377 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:13,377 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:13,377 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:13,377 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:13,378 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:13,378 INFO L754 eck$LassoCheckResult]: Loop: "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" [2025-04-26 16:22:13,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:13,378 INFO L85 PathProgramCache]: Analyzing trace with hash 920905714, now seen corresponding path program 3 times [2025-04-26 16:22:13,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:13,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397574366] [2025-04-26 16:22:13,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:13,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:13,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:13,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:13,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:13,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:13,381 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:13,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:13,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:13,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:13,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:13,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:13,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:13,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1432205049, now seen corresponding path program 9 times [2025-04-26 16:22:13,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:13,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31915935] [2025-04-26 16:22:13,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:13,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:13,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:13,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:13,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:13,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:13,387 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:13,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:13,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:13,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:13,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:13,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:13,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:13,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1558466568, now seen corresponding path program 7 times [2025-04-26 16:22:13,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:13,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057975876] [2025-04-26 16:22:13,390 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:13,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:13,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:22:13,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:22:13,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:13,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:13,394 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:13,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:22:13,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:22:13,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:13,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:13,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:13,530 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:13,530 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:13,530 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:13,530 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:13,530 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:13,530 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:13,530 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:13,530 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:13,530 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration16_Lasso [2025-04-26 16:22:13,530 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:13,530 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:13,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:13,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:13,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:13,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:13,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:13,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:13,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:13,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:13,785 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:13,785 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:13,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:13,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:13,787 INFO L229 MonitoredProcess]: Starting monitored process 262 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:13,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Waiting until timeout for monitored process [2025-04-26 16:22:13,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:13,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:13,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:13,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:13,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:13,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:13,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:13,801 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:13,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Ended with exit code 0 [2025-04-26 16:22:13,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:13,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:13,808 INFO L229 MonitoredProcess]: Starting monitored process 263 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:13,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Waiting until timeout for monitored process [2025-04-26 16:22:13,809 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:13,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:13,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:13,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:13,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:13,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:13,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:13,823 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:13,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:13,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:13,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:13,831 INFO L229 MonitoredProcess]: Starting monitored process 264 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:13,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Waiting until timeout for monitored process [2025-04-26 16:22:13,832 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:13,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:13,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:13,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:13,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:13,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:13,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:13,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:13,844 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:13,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:13,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:13,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:13,853 INFO L229 MonitoredProcess]: Starting monitored process 265 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:13,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Waiting until timeout for monitored process [2025-04-26 16:22:13,855 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:13,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:13,865 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:13,865 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:13,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:13,872 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:22:13,872 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:13,891 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:13,909 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:22:13,909 INFO L437 ModelExtractionUtils]: 9 out of 26 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-04-26 16:22:13,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:13,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:13,911 INFO L229 MonitoredProcess]: Starting monitored process 266 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:13,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Waiting until timeout for monitored process [2025-04-26 16:22:13,913 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:13,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Ended with exit code 0 [2025-04-26 16:22:13,929 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:13,929 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:13,929 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerWithAssertThread1of1ForFork0_i#1) = 2*workerWithAssertThread1of1ForFork0_i#1 + 1 Supporting invariants [3*cnt - 5*N + 2 >= 0] [2025-04-26 16:22:13,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Ended with exit code 0 [2025-04-26 16:22:13,937 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:13,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:13,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:13,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:13,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:13,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:13,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-26 16:22:13,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:14,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:14,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:14,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:14,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:14,107 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:14,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:14,181 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:14,181 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 5 loop predicates [2025-04-26 16:22:14,181 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1247 states and 3278 transitions. cyclomatic complexity: 2088 Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (in total 22), 12 states have internal predecessors, (22), 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:14,480 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1247 states and 3278 transitions. cyclomatic complexity: 2088. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (in total 22), 12 states have internal predecessors, (22), 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 2010 states and 5060 transitions. Complement of second has 21 states. [2025-04-26 16:22:14,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 8 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (in total 22), 12 states have internal predecessors, (22), 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:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 132 transitions. [2025-04-26 16:22:14,481 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 132 transitions. Stem has 14 letters. Loop has 8 letters. [2025-04-26 16:22:14,481 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:14,481 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 132 transitions. Stem has 22 letters. Loop has 8 letters. [2025-04-26 16:22:14,481 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:14,481 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 132 transitions. Stem has 14 letters. Loop has 16 letters. [2025-04-26 16:22:14,481 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:14,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2010 states and 5060 transitions. [2025-04-26 16:22:14,489 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2025-04-26 16:22:14,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2010 states to 1908 states and 4820 transitions. [2025-04-26 16:22:14,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1121 [2025-04-26 16:22:14,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1168 [2025-04-26 16:22:14,496 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1908 states and 4820 transitions. [2025-04-26 16:22:14,496 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:14,496 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1908 states and 4820 transitions. [2025-04-26 16:22:14,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states and 4820 transitions. [2025-04-26 16:22:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1257. [2025-04-26 16:22:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1257 states have (on average 2.6252983293556085) internal successors, (in total 3300), 1256 states have internal predecessors, (3300), 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:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 3300 transitions. [2025-04-26 16:22:14,512 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1257 states and 3300 transitions. [2025-04-26 16:22:14,512 INFO L438 stractBuchiCegarLoop]: Abstraction has 1257 states and 3300 transitions. [2025-04-26 16:22:14,512 INFO L340 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-04-26 16:22:14,513 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1257 states and 3300 transitions. [2025-04-26 16:22:14,515 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:22:14,515 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:14,515 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:14,516 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:14,516 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:14,516 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[109] L44-->workerWithAssertErr0ASSERT_VIOLATIONASSERT: Formula: (or (<= v_N_3 |v_workerWithAssertThread1of1ForFork0_i#1_7|) (< |v_workerWithAssertThread1of1ForFork0_i#1_7| 0)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_7|, N=v_N_3} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_7|, N=v_N_3} AuxVars[] AssignedVars[]" [2025-04-26 16:22:14,516 INFO L754 eck$LassoCheckResult]: Loop: "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" [2025-04-26 16:22:14,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:14,516 INFO L85 PathProgramCache]: Analyzing trace with hash -397967920, now seen corresponding path program 1 times [2025-04-26 16:22:14,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:14,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853598081] [2025-04-26 16:22:14,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:14,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:14,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:22:14,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:22:14,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:14,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:14,568 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:14,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:14,568 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853598081] [2025-04-26 16:22:14,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853598081] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:14,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:14,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:22:14,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425245850] [2025-04-26 16:22:14,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:14,568 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:22:14,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash 392240871, now seen corresponding path program 8 times [2025-04-26 16:22:14,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:14,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789501087] [2025-04-26 16:22:14,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:14,570 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:14,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:14,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:14,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:14,571 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:14,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:14,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:14,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:14,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:14,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:14,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:14,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:22:14,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:22:14,618 INFO L87 Difference]: Start difference. First operand 1257 states and 3300 transitions. cyclomatic complexity: 2100 Second operand has 6 states, 5 states have (on average 3.0) internal successors, (in total 15), 6 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:22:14,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:14,715 INFO L93 Difference]: Finished difference Result 1327 states and 3462 transitions. [2025-04-26 16:22:14,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1327 states and 3462 transitions. [2025-04-26 16:22:14,719 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:22:14,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1327 states to 1327 states and 3462 transitions. [2025-04-26 16:22:14,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 819 [2025-04-26 16:22:14,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 819 [2025-04-26 16:22:14,724 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1327 states and 3462 transitions. [2025-04-26 16:22:14,724 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:14,724 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1327 states and 3462 transitions. [2025-04-26 16:22:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states and 3462 transitions. [2025-04-26 16:22:14,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1241. [2025-04-26 16:22:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 1241 states have (on average 2.6140209508460917) internal successors, (in total 3244), 1240 states have internal predecessors, (3244), 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:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 3244 transitions. [2025-04-26 16:22:14,762 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1241 states and 3244 transitions. [2025-04-26 16:22:14,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-26 16:22:14,763 INFO L438 stractBuchiCegarLoop]: Abstraction has 1241 states and 3244 transitions. [2025-04-26 16:22:14,763 INFO L340 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-04-26 16:22:14,763 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1241 states and 3244 transitions. [2025-04-26 16:22:14,766 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:14,766 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:14,766 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:14,766 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:14,766 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:14,767 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[113] L54-->L57: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:22:14,767 INFO L754 eck$LassoCheckResult]: Loop: "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" [2025-04-26 16:22:14,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:14,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1174478336, now seen corresponding path program 1 times [2025-04-26 16:22:14,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:14,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774995045] [2025-04-26 16:22:14,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:14,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:14,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:14,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:14,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:14,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:14,771 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:14,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:14,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:14,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:14,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:14,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:14,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:14,774 INFO L85 PathProgramCache]: Analyzing trace with hash -712911557, now seen corresponding path program 10 times [2025-04-26 16:22:14,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:14,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560524761] [2025-04-26 16:22:14,774 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:14,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:14,776 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:22:14,777 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:14,777 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:14,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:14,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:14,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:14,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:14,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:14,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:14,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:14,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:14,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2026223558, now seen corresponding path program 1 times [2025-04-26 16:22:14,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:14,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737123520] [2025-04-26 16:22:14,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:14,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:14,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:22:14,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:22:14,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:14,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:14,789 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:14,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:22:14,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:22:14,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:14,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:14,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:14,931 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:14,931 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:14,931 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:14,931 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:14,931 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:14,931 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:14,931 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:14,931 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:14,931 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration18_Lasso [2025-04-26 16:22:14,931 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:14,931 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:14,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:14,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:14,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:14,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:14,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:14,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:14,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:14,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:15,096 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:15,096 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:15,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,097 INFO L229 MonitoredProcess]: Starting monitored process 267 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:15,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Waiting until timeout for monitored process [2025-04-26 16:22:15,099 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:15,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:15,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:15,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:15,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:15,110 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Ended with exit code 0 [2025-04-26 16:22:15,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,117 INFO L229 MonitoredProcess]: Starting monitored process 268 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:15,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Waiting until timeout for monitored process [2025-04-26 16:22:15,118 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:15,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:15,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:15,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:15,131 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Ended with exit code 0 [2025-04-26 16:22:15,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,138 INFO L229 MonitoredProcess]: Starting monitored process 269 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:15,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Waiting until timeout for monitored process [2025-04-26 16:22:15,139 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:15,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,149 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:15,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:15,155 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:22:15,155 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:15,169 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Ended with exit code 0 [2025-04-26 16:22:15,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,176 INFO L229 MonitoredProcess]: Starting monitored process 270 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:15,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Waiting until timeout for monitored process [2025-04-26 16:22:15,178 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:15,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:15,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:15,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:15,190 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Ended with exit code 0 [2025-04-26 16:22:15,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,197 INFO L229 MonitoredProcess]: Starting monitored process 271 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:15,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Waiting until timeout for monitored process [2025-04-26 16:22:15,199 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:15,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:15,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:15,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:15,212 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Ended with exit code 0 [2025-04-26 16:22:15,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,219 INFO L229 MonitoredProcess]: Starting monitored process 272 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:15,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Waiting until timeout for monitored process [2025-04-26 16:22:15,221 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:15,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:15,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:15,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:15,234 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Ended with exit code 0 [2025-04-26 16:22:15,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,241 INFO L229 MonitoredProcess]: Starting monitored process 273 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:15,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Waiting until timeout for monitored process [2025-04-26 16:22:15,243 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:15,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:15,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:15,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:15,255 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Ended with exit code 0 [2025-04-26 16:22:15,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,263 INFO L229 MonitoredProcess]: Starting monitored process 274 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:15,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (274)] Waiting until timeout for monitored process [2025-04-26 16:22:15,265 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:15,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:15,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:15,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:15,277 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (274)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:15,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,285 INFO L229 MonitoredProcess]: Starting monitored process 275 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:15,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Waiting until timeout for monitored process [2025-04-26 16:22:15,286 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:15,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:15,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:15,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:15,299 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:15,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,306 INFO L229 MonitoredProcess]: Starting monitored process 276 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:15,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Waiting until timeout for monitored process [2025-04-26 16:22:15,308 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:15,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:15,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:15,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:15,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:15,318 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:15,324 INFO L453 LassoAnalysis]: Using template '2-nested'. [2025-04-26 16:22:15,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,326 INFO L229 MonitoredProcess]: Starting monitored process 277 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:15,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Waiting until timeout for monitored process [2025-04-26 16:22:15,327 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:15,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:15,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,337 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:15,337 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:22:15,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:15,338 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Ended with exit code 0 [2025-04-26 16:22:15,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,345 INFO L229 MonitoredProcess]: Starting monitored process 278 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:15,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Waiting until timeout for monitored process [2025-04-26 16:22:15,347 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:15,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,357 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:15,358 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:15,358 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:15,361 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Ended with exit code 0 [2025-04-26 16:22:15,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,368 INFO L229 MonitoredProcess]: Starting monitored process 279 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:15,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Waiting until timeout for monitored process [2025-04-26 16:22:15,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:22:15,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,380 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:15,380 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:15,388 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:22:15,389 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:15,411 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Ended with exit code 0 [2025-04-26 16:22:15,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,419 INFO L229 MonitoredProcess]: Starting monitored process 280 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:15,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (280)] Waiting until timeout for monitored process [2025-04-26 16:22:15,428 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:15,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,438 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:15,439 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:15,439 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:15,442 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (280)] Ended with exit code 0 [2025-04-26 16:22:15,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,449 INFO L229 MonitoredProcess]: Starting monitored process 281 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:15,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (281)] Waiting until timeout for monitored process [2025-04-26 16:22:15,451 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:15,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,460 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:15,462 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:15,462 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:15,465 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (281)] Ended with exit code 0 [2025-04-26 16:22:15,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,472 INFO L229 MonitoredProcess]: Starting monitored process 282 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:15,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (282)] Waiting until timeout for monitored process [2025-04-26 16:22:15,475 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:15,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,485 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:15,486 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:15,486 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:15,489 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (282)] Ended with exit code 0 [2025-04-26 16:22:15,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,497 INFO L229 MonitoredProcess]: Starting monitored process 283 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:15,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Waiting until timeout for monitored process [2025-04-26 16:22:15,498 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:15,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,508 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:15,509 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:15,509 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:15,513 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Ended with exit code 0 [2025-04-26 16:22:15,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,521 INFO L229 MonitoredProcess]: Starting monitored process 284 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:15,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Waiting until timeout for monitored process [2025-04-26 16:22:15,525 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:15,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,535 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:15,536 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:15,537 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:15,540 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Ended with exit code 0 [2025-04-26 16:22:15,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,547 INFO L229 MonitoredProcess]: Starting monitored process 285 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:15,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Waiting until timeout for monitored process [2025-04-26 16:22:15,549 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:15,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,559 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:15,560 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:15,560 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:15,563 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Ended with exit code 0 [2025-04-26 16:22:15,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,570 INFO L229 MonitoredProcess]: Starting monitored process 286 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:15,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (286)] Waiting until timeout for monitored process [2025-04-26 16:22:15,572 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:15,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:15,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,582 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:15,582 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:22:15,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:15,583 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (286)] Ended with exit code 0 [2025-04-26 16:22:15,589 INFO L453 LassoAnalysis]: Using template '3-nested'. [2025-04-26 16:22:15,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,590 INFO L229 MonitoredProcess]: Starting monitored process 287 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:15,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Waiting until timeout for monitored process [2025-04-26 16:22:15,592 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:15,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:15,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,602 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:15,603 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:22:15,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:15,604 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Ended with exit code 0 [2025-04-26 16:22:15,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,635 INFO L229 MonitoredProcess]: Starting monitored process 288 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:15,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Waiting until timeout for monitored process [2025-04-26 16:22:15,636 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:15,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,647 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:15,648 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:15,648 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:15,652 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Ended with exit code 0 [2025-04-26 16:22:15,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,659 INFO L229 MonitoredProcess]: Starting monitored process 289 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:15,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (289)] Waiting until timeout for monitored process [2025-04-26 16:22:15,661 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:15,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,671 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:15,671 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:15,683 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2025-04-26 16:22:15,683 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:22:15,716 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (289)] Ended with exit code 0 [2025-04-26 16:22:15,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,724 INFO L229 MonitoredProcess]: Starting monitored process 290 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:15,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Waiting until timeout for monitored process [2025-04-26 16:22:15,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:22:15,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,736 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:15,737 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:15,737 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:15,741 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Ended with exit code 0 [2025-04-26 16:22:15,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,748 INFO L229 MonitoredProcess]: Starting monitored process 291 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:15,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Waiting until timeout for monitored process [2025-04-26 16:22:15,749 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:15,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,760 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:15,761 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:15,761 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:15,766 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Ended with exit code 0 [2025-04-26 16:22:15,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,776 INFO L229 MonitoredProcess]: Starting monitored process 292 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:15,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Waiting until timeout for monitored process [2025-04-26 16:22:15,777 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:15,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,787 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:15,788 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:15,788 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:15,792 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Ended with exit code 0 [2025-04-26 16:22:15,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,799 INFO L229 MonitoredProcess]: Starting monitored process 293 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:15,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (293)] Waiting until timeout for monitored process [2025-04-26 16:22:15,800 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:15,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,810 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:15,812 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:15,812 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:15,815 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (293)] Ended with exit code 0 [2025-04-26 16:22:15,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,822 INFO L229 MonitoredProcess]: Starting monitored process 294 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:15,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (294)] Waiting until timeout for monitored process [2025-04-26 16:22:15,824 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:15,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,833 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:15,835 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:15,835 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:15,838 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (294)] Ended with exit code 0 [2025-04-26 16:22:15,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,845 INFO L229 MonitoredProcess]: Starting monitored process 295 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:15,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (295)] Waiting until timeout for monitored process [2025-04-26 16:22:15,847 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:15,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,857 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:15,858 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:15,858 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:15,861 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (295)] Ended with exit code 0 [2025-04-26 16:22:15,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,869 INFO L229 MonitoredProcess]: Starting monitored process 296 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:15,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (296)] Waiting until timeout for monitored process [2025-04-26 16:22:15,870 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:15,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:15,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,880 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:15,880 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:22:15,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:15,881 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (296)] Ended with exit code 0 [2025-04-26 16:22:15,887 INFO L453 LassoAnalysis]: Using template '4-nested'. [2025-04-26 16:22:15,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,889 INFO L229 MonitoredProcess]: Starting monitored process 297 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:15,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (297)] Waiting until timeout for monitored process [2025-04-26 16:22:15,890 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:15,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:15,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,900 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:15,900 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:22:15,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:15,902 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (297)] Ended with exit code 0 [2025-04-26 16:22:15,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,909 INFO L229 MonitoredProcess]: Starting monitored process 298 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:15,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (298)] Waiting until timeout for monitored process [2025-04-26 16:22:15,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:22:15,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:15,920 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:15,922 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:15,922 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:15,926 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:15,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (298)] Ended with exit code 0 [2025-04-26 16:22:15,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:15,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:15,933 INFO L229 MonitoredProcess]: Starting monitored process 299 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:15,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (299)] Waiting until timeout for monitored process [2025-04-26 16:22:15,935 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:15,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:15,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:15,945 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:15,945 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:15,959 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2025-04-26 16:22:15,960 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2025-04-26 16:22:15,997 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (299)] Ended with exit code 0 [2025-04-26 16:22:16,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,005 INFO L229 MonitoredProcess]: Starting monitored process 300 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:16,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (300)] Waiting until timeout for monitored process [2025-04-26 16:22:16,007 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:16,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:16,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,016 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:16,018 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:16,018 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:16,022 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (300)] Ended with exit code 0 [2025-04-26 16:22:16,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,029 INFO L229 MonitoredProcess]: Starting monitored process 301 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:16,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (301)] Waiting until timeout for monitored process [2025-04-26 16:22:16,030 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:16,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:16,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,041 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:16,042 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:16,042 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:16,048 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (301)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:16,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,055 INFO L229 MonitoredProcess]: Starting monitored process 302 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:16,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (302)] Waiting until timeout for monitored process [2025-04-26 16:22:16,056 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:16,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:16,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,066 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:16,068 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:16,068 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:16,072 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (302)] Ended with exit code 0 [2025-04-26 16:22:16,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,079 INFO L229 MonitoredProcess]: Starting monitored process 303 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:16,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (303)] Waiting until timeout for monitored process [2025-04-26 16:22:16,081 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:16,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:16,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,090 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:16,092 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:16,092 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:16,096 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (303)] Ended with exit code 0 [2025-04-26 16:22:16,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,102 INFO L229 MonitoredProcess]: Starting monitored process 304 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:16,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (304)] Waiting until timeout for monitored process [2025-04-26 16:22:16,104 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:16,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:16,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,114 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:16,115 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:16,115 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:16,119 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (304)] Ended with exit code 0 [2025-04-26 16:22:16,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,126 INFO L229 MonitoredProcess]: Starting monitored process 305 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:16,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (305)] Waiting until timeout for monitored process [2025-04-26 16:22:16,127 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:16,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:16,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,138 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:16,139 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:16,139 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:16,143 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (305)] Ended with exit code 0 [2025-04-26 16:22:16,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,150 INFO L229 MonitoredProcess]: Starting monitored process 306 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:16,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (306)] Waiting until timeout for monitored process [2025-04-26 16:22:16,152 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:16,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:16,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:16,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,162 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:16,162 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:22:16,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:16,163 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (306)] Ended with exit code 0 [2025-04-26 16:22:16,169 INFO L453 LassoAnalysis]: Using template '2-phase'. [2025-04-26 16:22:16,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,170 INFO L229 MonitoredProcess]: Starting monitored process 307 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:16,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (307)] Waiting until timeout for monitored process [2025-04-26 16:22:16,172 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:16,182 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,182 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:16,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:16,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,182 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:16,182 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:22:16,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:16,184 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (307)] Ended with exit code 0 [2025-04-26 16:22:16,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,191 INFO L229 MonitoredProcess]: Starting monitored process 308 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:16,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (308)] Waiting until timeout for monitored process [2025-04-26 16:22:16,192 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:16,202 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,202 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:16,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,202 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:16,203 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:16,203 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:16,207 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (308)] Ended with exit code 0 [2025-04-26 16:22:16,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,214 INFO L229 MonitoredProcess]: Starting monitored process 309 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:16,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (309)] Waiting until timeout for monitored process [2025-04-26 16:22:16,216 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:16,225 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,226 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:16,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,226 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:16,226 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:16,235 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:22:16,235 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:16,270 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (309)] Ended with exit code 0 [2025-04-26 16:22:16,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,278 INFO L229 MonitoredProcess]: Starting monitored process 310 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:16,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (310)] Waiting until timeout for monitored process [2025-04-26 16:22:16,279 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:16,289 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,289 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:16,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,289 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:16,290 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:16,290 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:16,293 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (310)] Ended with exit code 0 [2025-04-26 16:22:16,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,300 INFO L229 MonitoredProcess]: Starting monitored process 311 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:16,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (311)] Waiting until timeout for monitored process [2025-04-26 16:22:16,302 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:16,311 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,312 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:16,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,312 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:16,313 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:16,313 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:16,318 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (311)] Ended with exit code 0 [2025-04-26 16:22:16,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,325 INFO L229 MonitoredProcess]: Starting monitored process 312 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:16,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (312)] Waiting until timeout for monitored process [2025-04-26 16:22:16,327 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:16,338 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,338 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:16,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,338 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:16,339 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:16,339 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:16,342 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (312)] Ended with exit code 0 [2025-04-26 16:22:16,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,350 INFO L229 MonitoredProcess]: Starting monitored process 313 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:16,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (313)] Waiting until timeout for monitored process [2025-04-26 16:22:16,352 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:16,362 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,362 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:16,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,362 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:16,363 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:16,363 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:16,367 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (313)] Ended with exit code 0 [2025-04-26 16:22:16,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,375 INFO L229 MonitoredProcess]: Starting monitored process 314 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:16,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (314)] Waiting until timeout for monitored process [2025-04-26 16:22:16,376 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:16,386 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,386 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:16,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,386 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:16,387 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:16,387 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:16,391 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (314)] Ended with exit code 0 [2025-04-26 16:22:16,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,398 INFO L229 MonitoredProcess]: Starting monitored process 315 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:16,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (315)] Waiting until timeout for monitored process [2025-04-26 16:22:16,400 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:16,410 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,410 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:16,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,410 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:16,411 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:16,411 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:16,415 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (315)] Ended with exit code 0 [2025-04-26 16:22:16,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,423 INFO L229 MonitoredProcess]: Starting monitored process 316 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:16,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (316)] Waiting until timeout for monitored process [2025-04-26 16:22:16,425 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:16,434 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,434 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:16,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:16,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,435 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:16,435 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:22:16,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:16,437 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (316)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:16,442 INFO L453 LassoAnalysis]: Using template '3-phase'. [2025-04-26 16:22:16,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,444 INFO L229 MonitoredProcess]: Starting monitored process 317 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:16,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (317)] Waiting until timeout for monitored process [2025-04-26 16:22:16,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:16,456 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,456 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:16,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:16,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,456 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:16,456 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:22:16,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:16,459 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (317)] Ended with exit code 0 [2025-04-26 16:22:16,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,466 INFO L229 MonitoredProcess]: Starting monitored process 318 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:16,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (318)] Waiting until timeout for monitored process [2025-04-26 16:22:16,467 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:16,477 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,477 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:16,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,478 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:16,479 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:16,479 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:16,485 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (318)] Ended with exit code 0 [2025-04-26 16:22:16,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,495 INFO L229 MonitoredProcess]: Starting monitored process 319 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:16,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (319)] Waiting until timeout for monitored process [2025-04-26 16:22:16,498 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:16,509 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,509 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:16,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,509 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:16,509 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:16,523 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2025-04-26 16:22:16,523 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:22:16,567 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (319)] Ended with exit code 0 [2025-04-26 16:22:16,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,575 INFO L229 MonitoredProcess]: Starting monitored process 320 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:16,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (320)] Waiting until timeout for monitored process [2025-04-26 16:22:16,576 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:16,586 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,586 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:16,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,586 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:16,588 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:16,588 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:16,593 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (320)] Ended with exit code 0 [2025-04-26 16:22:16,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,600 INFO L229 MonitoredProcess]: Starting monitored process 321 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:16,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (321)] Waiting until timeout for monitored process [2025-04-26 16:22:16,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:16,611 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,611 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:16,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,611 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:16,612 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:16,612 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:16,618 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (321)] Ended with exit code 0 [2025-04-26 16:22:16,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,625 INFO L229 MonitoredProcess]: Starting monitored process 322 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:16,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (322)] Waiting until timeout for monitored process [2025-04-26 16:22:16,626 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:16,636 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,636 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:16,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,637 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:16,638 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:16,638 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:16,642 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (322)] Ended with exit code 0 [2025-04-26 16:22:16,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,649 INFO L229 MonitoredProcess]: Starting monitored process 323 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:16,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (323)] Waiting until timeout for monitored process [2025-04-26 16:22:16,651 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:16,660 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,661 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:16,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,661 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:16,662 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:16,662 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:16,667 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (323)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:16,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,675 INFO L229 MonitoredProcess]: Starting monitored process 324 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:16,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (324)] Waiting until timeout for monitored process [2025-04-26 16:22:16,676 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:16,686 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,686 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:16,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,687 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:16,688 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:16,688 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:16,693 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (324)] Ended with exit code 0 [2025-04-26 16:22:16,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,700 INFO L229 MonitoredProcess]: Starting monitored process 325 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:16,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (325)] Waiting until timeout for monitored process [2025-04-26 16:22:16,702 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:16,712 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,712 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:16,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,712 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:16,713 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:16,714 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:16,718 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (325)] Ended with exit code 0 [2025-04-26 16:22:16,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,726 INFO L229 MonitoredProcess]: Starting monitored process 326 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:16,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (326)] Waiting until timeout for monitored process [2025-04-26 16:22:16,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:22:16,737 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,737 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:16,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:16,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,738 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:16,742 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:22:16,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:16,744 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (326)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:16,756 INFO L453 LassoAnalysis]: Using template '4-phase'. [2025-04-26 16:22:16,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,758 INFO L229 MonitoredProcess]: Starting monitored process 327 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:16,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (327)] Waiting until timeout for monitored process [2025-04-26 16:22:16,759 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:16,769 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,770 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:16,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:16,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,770 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:16,770 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:22:16,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:16,773 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (327)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:16,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,781 INFO L229 MonitoredProcess]: Starting monitored process 328 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:16,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (328)] Waiting until timeout for monitored process [2025-04-26 16:22:16,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:22:16,792 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,792 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:16,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,792 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:16,794 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:16,794 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:16,801 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (328)] Ended with exit code 0 [2025-04-26 16:22:16,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,809 INFO L229 MonitoredProcess]: Starting monitored process 329 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:16,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (329)] Waiting until timeout for monitored process [2025-04-26 16:22:16,810 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:16,820 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,820 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:16,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,821 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:16,821 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:16,835 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2025-04-26 16:22:16,836 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2025-04-26 16:22:16,893 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (329)] Ended with exit code 0 [2025-04-26 16:22:16,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,901 INFO L229 MonitoredProcess]: Starting monitored process 330 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:16,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (330)] Waiting until timeout for monitored process [2025-04-26 16:22:16,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:22:16,913 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,913 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:16,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,913 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:16,915 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:16,915 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:16,921 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (330)] Ended with exit code 0 [2025-04-26 16:22:16,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,928 INFO L229 MonitoredProcess]: Starting monitored process 331 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:16,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (331)] Waiting until timeout for monitored process [2025-04-26 16:22:16,929 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:16,939 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,939 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:16,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,939 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:16,941 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:16,941 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:16,949 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (331)] Ended with exit code 0 [2025-04-26 16:22:16,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,957 INFO L229 MonitoredProcess]: Starting monitored process 332 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:16,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (332)] Waiting until timeout for monitored process [2025-04-26 16:22:16,958 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:16,968 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,968 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:16,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,968 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:16,970 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:16,970 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:16,976 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (332)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:16,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,984 INFO L229 MonitoredProcess]: Starting monitored process 333 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:16,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (333)] Waiting until timeout for monitored process [2025-04-26 16:22:16,985 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:16,995 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:16,995 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:16,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,995 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:16,997 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:16,997 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:17,003 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:17,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (333)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:17,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:17,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:17,011 INFO L229 MonitoredProcess]: Starting monitored process 334 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:17,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (334)] Waiting until timeout for monitored process [2025-04-26 16:22:17,013 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:17,024 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:17,024 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:17,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:17,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:17,024 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:17,025 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:17,025 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:17,032 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:17,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (334)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:17,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:17,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:17,040 INFO L229 MonitoredProcess]: Starting monitored process 335 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:17,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (335)] Waiting until timeout for monitored process [2025-04-26 16:22:17,042 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:17,052 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:17,052 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:17,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:17,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:17,052 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:17,054 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:17,054 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:17,060 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:17,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (335)] Ended with exit code 0 [2025-04-26 16:22:17,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:17,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:17,067 INFO L229 MonitoredProcess]: Starting monitored process 336 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:17,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (336)] Waiting until timeout for monitored process [2025-04-26 16:22:17,069 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:17,081 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:17,081 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:17,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:17,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:17,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:17,081 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:17,081 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:22:17,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:17,084 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:17,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (336)] Ended with exit code 0 [2025-04-26 16:22:17,089 INFO L453 LassoAnalysis]: Using template '2-lex'. [2025-04-26 16:22:17,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:17,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:17,091 INFO L229 MonitoredProcess]: Starting monitored process 337 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:17,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (337)] Waiting until timeout for monitored process [2025-04-26 16:22:17,093 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:17,102 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:17,102 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:17,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:17,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:17,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:17,102 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:17,103 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:22:17,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:17,104 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:17,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (337)] Ended with exit code 0 [2025-04-26 16:22:17,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:17,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:17,111 INFO L229 MonitoredProcess]: Starting monitored process 338 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:17,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (338)] Waiting until timeout for monitored process [2025-04-26 16:22:17,122 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:17,131 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:17,132 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:17,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:17,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:17,132 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:17,133 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:17,133 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:17,137 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:17,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (338)] Ended with exit code 0 [2025-04-26 16:22:17,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:17,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:17,144 INFO L229 MonitoredProcess]: Starting monitored process 339 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:17,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (339)] Waiting until timeout for monitored process [2025-04-26 16:22:17,146 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:17,155 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:17,156 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:17,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:17,156 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:17,156 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:17,167 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2025-04-26 16:22:17,167 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:22:17,222 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:17,292 INFO L436 ModelExtractionUtils]: Simplification made 32 calls to the SMT solver. [2025-04-26 16:22:17,292 INFO L437 ModelExtractionUtils]: 23 out of 52 variables were initially zero. Simplification set additionally 21 variables to zero. [2025-04-26 16:22:17,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:17,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:17,294 INFO L229 MonitoredProcess]: Starting monitored process 340 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:17,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (340)] Waiting until timeout for monitored process [2025-04-26 16:22:17,295 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:17,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (340)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:17,314 INFO L439 nArgumentSynthesizer]: Removed 7 redundant supporting invariants from a total of 8. [2025-04-26 16:22:17,314 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:17,314 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function 2-lexicographic ranking function: f(N, cnt, workerWithAssertThread1of1ForFork0_steal_x#1) = Supporting invariants [-3*cnt + 4*N >= 0] [2025-04-26 16:22:17,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (339)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:17,323 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:17,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:17,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:17,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:17,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:17,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:17,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:17,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:17,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:17,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:17,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:17,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:17,359 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:17,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:17,409 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:17,409 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 16:22:17,409 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1241 states and 3244 transitions. cyclomatic complexity: 2058 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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:22:17,513 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1241 states and 3244 transitions. cyclomatic complexity: 2058. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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) Result 1436 states and 3666 transitions. Complement of second has 15 states. [2025-04-26 16:22:17,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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:22:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2025-04-26 16:22:17,514 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 59 transitions. Stem has 16 letters. Loop has 8 letters. [2025-04-26 16:22:17,514 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:17,514 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 59 transitions. Stem has 24 letters. Loop has 8 letters. [2025-04-26 16:22:17,514 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:17,514 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 59 transitions. Stem has 16 letters. Loop has 16 letters. [2025-04-26 16:22:17,514 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:17,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1436 states and 3666 transitions. [2025-04-26 16:22:17,519 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 224 [2025-04-26 16:22:17,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1436 states to 1338 states and 3438 transitions. [2025-04-26 16:22:17,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 838 [2025-04-26 16:22:17,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 868 [2025-04-26 16:22:17,523 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1338 states and 3438 transitions. [2025-04-26 16:22:17,523 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:17,523 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1338 states and 3438 transitions. [2025-04-26 16:22:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states and 3438 transitions. [2025-04-26 16:22:17,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1241. [2025-04-26 16:22:17,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 1241 states have (on average 2.6107977437550365) internal successors, (in total 3240), 1240 states have internal predecessors, (3240), 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:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 3240 transitions. [2025-04-26 16:22:17,535 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1241 states and 3240 transitions. [2025-04-26 16:22:17,535 INFO L438 stractBuchiCegarLoop]: Abstraction has 1241 states and 3240 transitions. [2025-04-26 16:22:17,535 INFO L340 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-04-26 16:22:17,535 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1241 states and 3240 transitions. [2025-04-26 16:22:17,538 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:17,538 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:17,538 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:17,538 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:17,538 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:17,538 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:17,538 INFO L754 eck$LassoCheckResult]: Loop: "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:22:17,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:17,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1207881728, now seen corresponding path program 1 times [2025-04-26 16:22:17,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:17,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724011369] [2025-04-26 16:22:17,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:17,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:17,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:17,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:17,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:17,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:17,541 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:17,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:17,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:17,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:17,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:17,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:17,544 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:17,544 INFO L85 PathProgramCache]: Analyzing trace with hash -53527749, now seen corresponding path program 11 times [2025-04-26 16:22:17,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:17,544 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159063270] [2025-04-26 16:22:17,544 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:17,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:17,545 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:17,546 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:17,546 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:17,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:17,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:17,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:17,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:17,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:17,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:17,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:17,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:17,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1683749946, now seen corresponding path program 8 times [2025-04-26 16:22:17,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:17,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25227080] [2025-04-26 16:22:17,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:17,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:17,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:17,551 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:17,551 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:17,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:17,744 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:17,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:17,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25227080] [2025-04-26 16:22:17,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25227080] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:17,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:17,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:17,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559912530] [2025-04-26 16:22:17,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:17,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:17,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:17,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:17,785 INFO L87 Difference]: Start difference. First operand 1241 states and 3240 transitions. cyclomatic complexity: 2054 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:18,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:18,063 INFO L93 Difference]: Finished difference Result 1715 states and 4355 transitions. [2025-04-26 16:22:18,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1715 states and 4355 transitions. [2025-04-26 16:22:18,069 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:18,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1715 states to 1687 states and 4299 transitions. [2025-04-26 16:22:18,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1020 [2025-04-26 16:22:18,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1020 [2025-04-26 16:22:18,074 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1687 states and 4299 transitions. [2025-04-26 16:22:18,074 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:18,074 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1687 states and 4299 transitions. [2025-04-26 16:22:18,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states and 4299 transitions. [2025-04-26 16:22:18,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1283. [2025-04-26 16:22:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1283 states have (on average 2.6071706936866716) internal successors, (in total 3345), 1282 states have internal predecessors, (3345), 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:18,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 3345 transitions. [2025-04-26 16:22:18,087 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1283 states and 3345 transitions. [2025-04-26 16:22:18,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-26 16:22:18,088 INFO L438 stractBuchiCegarLoop]: Abstraction has 1283 states and 3345 transitions. [2025-04-26 16:22:18,088 INFO L340 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-04-26 16:22:18,088 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1283 states and 3345 transitions. [2025-04-26 16:22:18,091 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:18,091 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:18,091 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:18,091 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:18,091 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:18,091 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[107] L41-->L42: Formula: (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:18,091 INFO L754 eck$LassoCheckResult]: Loop: "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" [2025-04-26 16:22:18,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:18,092 INFO L85 PathProgramCache]: Analyzing trace with hash -64618243, now seen corresponding path program 1 times [2025-04-26 16:22:18,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:18,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629644045] [2025-04-26 16:22:18,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:18,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:18,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:18,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:18,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:18,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:18,095 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:18,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:18,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:18,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:18,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:18,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:18,097 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:18,097 INFO L85 PathProgramCache]: Analyzing trace with hash 57660507, now seen corresponding path program 9 times [2025-04-26 16:22:18,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:18,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024049515] [2025-04-26 16:22:18,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:18,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:18,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:18,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:18,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:18,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:18,100 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:18,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:18,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:18,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:18,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:18,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:18,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:18,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1827871063, now seen corresponding path program 4 times [2025-04-26 16:22:18,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:18,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95130919] [2025-04-26 16:22:18,103 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:18,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:18,105 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-26 16:22:18,107 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:18,107 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-26 16:22:18,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:18,255 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:18,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:18,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95130919] [2025-04-26 16:22:18,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95130919] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:18,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:18,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:18,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463881252] [2025-04-26 16:22:18,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:18,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:18,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:18,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:18,291 INFO L87 Difference]: Start difference. First operand 1283 states and 3345 transitions. cyclomatic complexity: 2117 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:18,541 INFO L93 Difference]: Finished difference Result 1820 states and 4574 transitions. [2025-04-26 16:22:18,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1820 states and 4574 transitions. [2025-04-26 16:22:18,547 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 224 [2025-04-26 16:22:18,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1820 states to 1792 states and 4518 transitions. [2025-04-26 16:22:18,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1077 [2025-04-26 16:22:18,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1077 [2025-04-26 16:22:18,552 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1792 states and 4518 transitions. [2025-04-26 16:22:18,552 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:18,552 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1792 states and 4518 transitions. [2025-04-26 16:22:18,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states and 4518 transitions. [2025-04-26 16:22:18,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1313. [2025-04-26 16:22:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 1313 states have (on average 2.6077684691546077) internal successors, (in total 3424), 1312 states have internal predecessors, (3424), 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:18,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 3424 transitions. [2025-04-26 16:22:18,586 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1313 states and 3424 transitions. [2025-04-26 16:22:18,588 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-26 16:22:18,588 INFO L438 stractBuchiCegarLoop]: Abstraction has 1313 states and 3424 transitions. [2025-04-26 16:22:18,588 INFO L340 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-04-26 16:22:18,588 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1313 states and 3424 transitions. [2025-04-26 16:22:18,591 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:18,591 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:18,591 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:18,592 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:18,592 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:18,592 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:18,592 INFO L754 eck$LassoCheckResult]: Loop: "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:22:18,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:18,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1208090978, now seen corresponding path program 2 times [2025-04-26 16:22:18,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:18,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122604705] [2025-04-26 16:22:18,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:18,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:18,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:18,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:18,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:18,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:18,596 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:18,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:18,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:18,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:18,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:18,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:18,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:18,598 INFO L85 PathProgramCache]: Analyzing trace with hash -53527749, now seen corresponding path program 12 times [2025-04-26 16:22:18,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:18,598 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900770153] [2025-04-26 16:22:18,598 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:18,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:18,599 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:18,600 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:18,600 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:18,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:18,600 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:18,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:18,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:18,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:18,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:18,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:18,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:18,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1005014232, now seen corresponding path program 9 times [2025-04-26 16:22:18,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:18,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328862228] [2025-04-26 16:22:18,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:18,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:18,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:18,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:18,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:18,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:18,766 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:18,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:18,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328862228] [2025-04-26 16:22:18,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328862228] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:18,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:18,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:18,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060793340] [2025-04-26 16:22:18,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:18,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:18,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:18,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:18,800 INFO L87 Difference]: Start difference. First operand 1313 states and 3424 transitions. cyclomatic complexity: 2166 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:19,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:19,049 INFO L93 Difference]: Finished difference Result 1851 states and 4700 transitions. [2025-04-26 16:22:19,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1851 states and 4700 transitions. [2025-04-26 16:22:19,056 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:19,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1851 states to 1823 states and 4644 transitions. [2025-04-26 16:22:19,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1111 [2025-04-26 16:22:19,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1111 [2025-04-26 16:22:19,063 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1823 states and 4644 transitions. [2025-04-26 16:22:19,063 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:19,063 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1823 states and 4644 transitions. [2025-04-26 16:22:19,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states and 4644 transitions. [2025-04-26 16:22:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1317. [2025-04-26 16:22:19,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1317 states have (on average 2.607441154138193) internal successors, (in total 3434), 1316 states have internal predecessors, (3434), 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:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 3434 transitions. [2025-04-26 16:22:19,087 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1317 states and 3434 transitions. [2025-04-26 16:22:19,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:19,088 INFO L438 stractBuchiCegarLoop]: Abstraction has 1317 states and 3434 transitions. [2025-04-26 16:22:19,088 INFO L340 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-04-26 16:22:19,088 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1317 states and 3434 transitions. [2025-04-26 16:22:19,092 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:19,092 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:19,092 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:19,092 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:19,092 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:19,093 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:19,093 INFO L754 eck$LassoCheckResult]: Loop: "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:22:19,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:19,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1213453358, now seen corresponding path program 3 times [2025-04-26 16:22:19,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:19,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639285896] [2025-04-26 16:22:19,093 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:19,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:19,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:19,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:19,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:19,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:19,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:19,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:19,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:19,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:19,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:19,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:19,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:19,100 INFO L85 PathProgramCache]: Analyzing trace with hash -53527749, now seen corresponding path program 13 times [2025-04-26 16:22:19,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:19,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664370084] [2025-04-26 16:22:19,100 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:19,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:19,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:19,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:19,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:19,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:19,106 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:19,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:19,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:19,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:19,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:19,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:19,108 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:19,108 INFO L85 PathProgramCache]: Analyzing trace with hash -755038708, now seen corresponding path program 10 times [2025-04-26 16:22:19,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:19,108 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647241209] [2025-04-26 16:22:19,109 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:19,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:19,111 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-26 16:22:19,114 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:19,114 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-26 16:22:19,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:19,275 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:19,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:19,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647241209] [2025-04-26 16:22:19,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647241209] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:19,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:19,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:19,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830536219] [2025-04-26 16:22:19,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:19,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:19,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:19,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:19,305 INFO L87 Difference]: Start difference. First operand 1317 states and 3434 transitions. cyclomatic complexity: 2172 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:19,475 INFO L93 Difference]: Finished difference Result 1598 states and 4082 transitions. [2025-04-26 16:22:19,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1598 states and 4082 transitions. [2025-04-26 16:22:19,480 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:19,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1598 states to 1570 states and 4026 transitions. [2025-04-26 16:22:19,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 975 [2025-04-26 16:22:19,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 975 [2025-04-26 16:22:19,486 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1570 states and 4026 transitions. [2025-04-26 16:22:19,486 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:19,486 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1570 states and 4026 transitions. [2025-04-26 16:22:19,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states and 4026 transitions. [2025-04-26 16:22:19,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1329. [2025-04-26 16:22:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1329 states have (on average 2.613995485327314) internal successors, (in total 3474), 1328 states have internal predecessors, (3474), 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:19,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 3474 transitions. [2025-04-26 16:22:19,512 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1329 states and 3474 transitions. [2025-04-26 16:22:19,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:19,513 INFO L438 stractBuchiCegarLoop]: Abstraction has 1329 states and 3474 transitions. [2025-04-26 16:22:19,513 INFO L340 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-04-26 16:22:19,513 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1329 states and 3474 transitions. [2025-04-26 16:22:19,516 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:19,517 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:19,517 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:19,517 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:19,517 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:19,517 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[107] L41-->L42: Formula: (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:19,517 INFO L754 eck$LassoCheckResult]: Loop: "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" [2025-04-26 16:22:19,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:19,518 INFO L85 PathProgramCache]: Analyzing trace with hash 129298141, now seen corresponding path program 2 times [2025-04-26 16:22:19,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:19,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367292908] [2025-04-26 16:22:19,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:19,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:19,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:19,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:19,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:19,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:19,521 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:19,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:19,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:19,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:19,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:19,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:19,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:19,528 INFO L85 PathProgramCache]: Analyzing trace with hash 57660507, now seen corresponding path program 10 times [2025-04-26 16:22:19,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:19,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520819052] [2025-04-26 16:22:19,528 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:19,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:19,530 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:22:19,531 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:19,531 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:19,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:19,531 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:19,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:19,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:19,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:19,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:19,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:19,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:19,535 INFO L85 PathProgramCache]: Analyzing trace with hash 556148535, now seen corresponding path program 5 times [2025-04-26 16:22:19,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:19,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883875529] [2025-04-26 16:22:19,536 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:19,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:19,538 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:19,540 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:19,540 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:19,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:19,674 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:19,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:19,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883875529] [2025-04-26 16:22:19,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883875529] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:19,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:19,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:19,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252262966] [2025-04-26 16:22:19,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:19,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:19,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:19,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:19,710 INFO L87 Difference]: Start difference. First operand 1329 states and 3474 transitions. cyclomatic complexity: 2200 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:19,989 INFO L93 Difference]: Finished difference Result 2332 states and 5887 transitions. [2025-04-26 16:22:19,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2332 states and 5887 transitions. [2025-04-26 16:22:19,998 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 224 [2025-04-26 16:22:20,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2332 states to 2304 states and 5831 transitions. [2025-04-26 16:22:20,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1255 [2025-04-26 16:22:20,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1255 [2025-04-26 16:22:20,007 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2304 states and 5831 transitions. [2025-04-26 16:22:20,007 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:20,007 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2304 states and 5831 transitions. [2025-04-26 16:22:20,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states and 5831 transitions. [2025-04-26 16:22:20,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 1360. [2025-04-26 16:22:20,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1360 states have (on average 2.6242647058823527) internal successors, (in total 3569), 1359 states have internal predecessors, (3569), 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:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 3569 transitions. [2025-04-26 16:22:20,031 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1360 states and 3569 transitions. [2025-04-26 16:22:20,031 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-26 16:22:20,032 INFO L438 stractBuchiCegarLoop]: Abstraction has 1360 states and 3569 transitions. [2025-04-26 16:22:20,032 INFO L340 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-04-26 16:22:20,032 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1360 states and 3569 transitions. [2025-04-26 16:22:20,037 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:20,037 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:20,037 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:20,038 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:20,038 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:20,039 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:20,039 INFO L754 eck$LassoCheckResult]: Loop: "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:22:20,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:20,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1627693628, now seen corresponding path program 4 times [2025-04-26 16:22:20,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:20,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301547122] [2025-04-26 16:22:20,040 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:20,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:20,042 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-26 16:22:20,044 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:20,044 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:20,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:20,044 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:20,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:20,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:20,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:20,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:20,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:20,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:20,047 INFO L85 PathProgramCache]: Analyzing trace with hash -53527749, now seen corresponding path program 14 times [2025-04-26 16:22:20,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:20,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968290788] [2025-04-26 16:22:20,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:20,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:20,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:20,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:20,050 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:20,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:20,050 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:20,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:20,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:20,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:20,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:20,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:20,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:20,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1027483134, now seen corresponding path program 11 times [2025-04-26 16:22:20,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:20,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797080407] [2025-04-26 16:22:20,053 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:20,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:20,056 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:20,058 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:20,058 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:20,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:20,208 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:20,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:20,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797080407] [2025-04-26 16:22:20,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797080407] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:20,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:20,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:20,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215875320] [2025-04-26 16:22:20,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:20,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:20,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:20,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:20,245 INFO L87 Difference]: Start difference. First operand 1360 states and 3569 transitions. cyclomatic complexity: 2264 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:20,535 INFO L93 Difference]: Finished difference Result 1814 states and 4632 transitions. [2025-04-26 16:22:20,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1814 states and 4632 transitions. [2025-04-26 16:22:20,541 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:20,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1814 states to 1786 states and 4576 transitions. [2025-04-26 16:22:20,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1119 [2025-04-26 16:22:20,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1119 [2025-04-26 16:22:20,547 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1786 states and 4576 transitions. [2025-04-26 16:22:20,547 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:20,547 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1786 states and 4576 transitions. [2025-04-26 16:22:20,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states and 4576 transitions. [2025-04-26 16:22:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1378. [2025-04-26 16:22:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1378 states have (on average 2.621190130624093) internal successors, (in total 3612), 1377 states have internal predecessors, (3612), 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:20,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 3612 transitions. [2025-04-26 16:22:20,561 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1378 states and 3612 transitions. [2025-04-26 16:22:20,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-26 16:22:20,561 INFO L438 stractBuchiCegarLoop]: Abstraction has 1378 states and 3612 transitions. [2025-04-26 16:22:20,561 INFO L340 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-04-26 16:22:20,562 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1378 states and 3612 transitions. [2025-04-26 16:22:20,565 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:20,565 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:20,565 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:20,565 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:20,565 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:20,566 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:20,566 INFO L754 eck$LassoCheckResult]: Loop: "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:22:20,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:20,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1627902878, now seen corresponding path program 5 times [2025-04-26 16:22:20,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:20,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459405768] [2025-04-26 16:22:20,566 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:20,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:20,567 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:20,569 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:20,569 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:20,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:20,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:20,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:20,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:20,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:20,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:20,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:20,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:20,571 INFO L85 PathProgramCache]: Analyzing trace with hash -53527749, now seen corresponding path program 15 times [2025-04-26 16:22:20,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:20,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793373932] [2025-04-26 16:22:20,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:20,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:20,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:20,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:20,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:20,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:20,573 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:20,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:20,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:20,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:20,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:20,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:20,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:20,575 INFO L85 PathProgramCache]: Analyzing trace with hash 348747420, now seen corresponding path program 12 times [2025-04-26 16:22:20,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:20,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496412706] [2025-04-26 16:22:20,575 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:20,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:20,577 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:20,578 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:20,578 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:20,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:20,718 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:20,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:20,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496412706] [2025-04-26 16:22:20,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496412706] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:20,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:20,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:20,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826069288] [2025-04-26 16:22:20,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:20,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:20,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:20,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:20,755 INFO L87 Difference]: Start difference. First operand 1378 states and 3612 transitions. cyclomatic complexity: 2289 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:21,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:21,008 INFO L93 Difference]: Finished difference Result 1920 states and 4898 transitions. [2025-04-26 16:22:21,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1920 states and 4898 transitions. [2025-04-26 16:22:21,014 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:21,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1920 states to 1892 states and 4842 transitions. [2025-04-26 16:22:21,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1180 [2025-04-26 16:22:21,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1180 [2025-04-26 16:22:21,020 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1892 states and 4842 transitions. [2025-04-26 16:22:21,020 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:21,020 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1892 states and 4842 transitions. [2025-04-26 16:22:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states and 4842 transitions. [2025-04-26 16:22:21,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1375. [2025-04-26 16:22:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1375 states have (on average 2.618181818181818) internal successors, (in total 3600), 1374 states have internal predecessors, (3600), 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:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 3600 transitions. [2025-04-26 16:22:21,035 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1375 states and 3600 transitions. [2025-04-26 16:22:21,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:21,036 INFO L438 stractBuchiCegarLoop]: Abstraction has 1375 states and 3600 transitions. [2025-04-26 16:22:21,036 INFO L340 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-04-26 16:22:21,036 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1375 states and 3600 transitions. [2025-04-26 16:22:21,039 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:21,040 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:21,040 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:21,040 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:21,040 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:21,040 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[107] L41-->L42: Formula: (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:21,040 INFO L754 eck$LassoCheckResult]: Loop: "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" [2025-04-26 16:22:21,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:21,040 INFO L85 PathProgramCache]: Analyzing trace with hash -64156963, now seen corresponding path program 3 times [2025-04-26 16:22:21,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:21,041 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367325237] [2025-04-26 16:22:21,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:21,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:21,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:21,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:21,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:21,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:21,043 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:21,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:21,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:21,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:21,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:21,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:21,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:21,046 INFO L85 PathProgramCache]: Analyzing trace with hash 57660507, now seen corresponding path program 11 times [2025-04-26 16:22:21,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:21,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264208825] [2025-04-26 16:22:21,046 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:21,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:21,047 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:21,048 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:21,048 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:21,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:21,048 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:21,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:21,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:21,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:21,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:21,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:21,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:21,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1715322057, now seen corresponding path program 6 times [2025-04-26 16:22:21,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:21,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110561414] [2025-04-26 16:22:21,050 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:21,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:21,051 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:21,053 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:21,053 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:21,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:21,174 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:21,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:21,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110561414] [2025-04-26 16:22:21,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110561414] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:21,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:21,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:21,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084492532] [2025-04-26 16:22:21,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:21,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:21,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:21,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:21,208 INFO L87 Difference]: Start difference. First operand 1375 states and 3600 transitions. cyclomatic complexity: 2280 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:21,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:21,397 INFO L93 Difference]: Finished difference Result 1993 states and 5024 transitions. [2025-04-26 16:22:21,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1993 states and 5024 transitions. [2025-04-26 16:22:21,403 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 224 [2025-04-26 16:22:21,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1993 states to 1965 states and 4968 transitions. [2025-04-26 16:22:21,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1205 [2025-04-26 16:22:21,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1205 [2025-04-26 16:22:21,407 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1965 states and 4968 transitions. [2025-04-26 16:22:21,407 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:21,407 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1965 states and 4968 transitions. [2025-04-26 16:22:21,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states and 4968 transitions. [2025-04-26 16:22:21,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1380. [2025-04-26 16:22:21,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1380 states have (on average 2.617391304347826) internal successors, (in total 3612), 1379 states have internal predecessors, (3612), 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:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 3612 transitions. [2025-04-26 16:22:21,420 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1380 states and 3612 transitions. [2025-04-26 16:22:21,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:21,420 INFO L438 stractBuchiCegarLoop]: Abstraction has 1380 states and 3612 transitions. [2025-04-26 16:22:21,420 INFO L340 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-04-26 16:22:21,421 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1380 states and 3612 transitions. [2025-04-26 16:22:21,423 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:21,423 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:21,423 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:21,424 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:21,424 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:21,424 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[107] L41-->L42: Formula: (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:21,424 INFO L754 eck$LassoCheckResult]: Loop: "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" [2025-04-26 16:22:21,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:21,424 INFO L85 PathProgramCache]: Analyzing trace with hash 129759421, now seen corresponding path program 4 times [2025-04-26 16:22:21,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:21,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363836874] [2025-04-26 16:22:21,424 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:21,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:21,426 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-26 16:22:21,427 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:21,427 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:21,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:21,427 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:21,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:21,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:21,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:21,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:21,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:21,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:21,429 INFO L85 PathProgramCache]: Analyzing trace with hash 57660507, now seen corresponding path program 12 times [2025-04-26 16:22:21,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:21,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146735018] [2025-04-26 16:22:21,429 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:21,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:21,430 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:21,430 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:21,430 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:21,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:21,430 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:21,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:21,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:21,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:21,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:21,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:21,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:21,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1307922711, now seen corresponding path program 7 times [2025-04-26 16:22:21,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:21,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010248333] [2025-04-26 16:22:21,432 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:21,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:21,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:21,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:21,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:21,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:21,589 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:21,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:21,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010248333] [2025-04-26 16:22:21,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010248333] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:21,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:21,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:21,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240908844] [2025-04-26 16:22:21,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:21,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:21,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:21,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:21,623 INFO L87 Difference]: Start difference. First operand 1380 states and 3612 transitions. cyclomatic complexity: 2287 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:21,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:21,831 INFO L93 Difference]: Finished difference Result 2113 states and 5367 transitions. [2025-04-26 16:22:21,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2113 states and 5367 transitions. [2025-04-26 16:22:21,838 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 224 [2025-04-26 16:22:21,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2113 states to 2085 states and 5311 transitions. [2025-04-26 16:22:21,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1200 [2025-04-26 16:22:21,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1200 [2025-04-26 16:22:21,842 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2085 states and 5311 transitions. [2025-04-26 16:22:21,842 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:21,842 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2085 states and 5311 transitions. [2025-04-26 16:22:21,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states and 5311 transitions. [2025-04-26 16:22:21,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1386. [2025-04-26 16:22:21,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1386 states have (on average 2.6204906204906204) internal successors, (in total 3632), 1385 states have internal predecessors, (3632), 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:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 3632 transitions. [2025-04-26 16:22:21,855 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1386 states and 3632 transitions. [2025-04-26 16:22:21,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:21,856 INFO L438 stractBuchiCegarLoop]: Abstraction has 1386 states and 3632 transitions. [2025-04-26 16:22:21,856 INFO L340 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-04-26 16:22:21,856 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1386 states and 3632 transitions. [2025-04-26 16:22:21,859 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:21,859 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:21,859 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:21,859 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:21,859 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:21,859 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[107] L41-->L42: Formula: (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:21,859 INFO L754 eck$LassoCheckResult]: Loop: "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" [2025-04-26 16:22:21,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:21,859 INFO L85 PathProgramCache]: Analyzing trace with hash -48963553, now seen corresponding path program 5 times [2025-04-26 16:22:21,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:21,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453956685] [2025-04-26 16:22:21,860 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:21,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:21,861 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:21,862 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:21,862 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:21,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:21,862 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:21,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:21,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:21,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:21,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:21,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:21,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:21,864 INFO L85 PathProgramCache]: Analyzing trace with hash 57660507, now seen corresponding path program 13 times [2025-04-26 16:22:21,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:21,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025642853] [2025-04-26 16:22:21,864 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:21,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:21,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:21,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:21,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:21,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:21,866 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:21,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:21,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:21,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:21,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:21,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:21,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:21,867 INFO L85 PathProgramCache]: Analyzing trace with hash -307644807, now seen corresponding path program 8 times [2025-04-26 16:22:21,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:21,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129425302] [2025-04-26 16:22:21,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:21,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:21,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:21,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:21,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:21,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:21,985 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:21,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:21,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129425302] [2025-04-26 16:22:21,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129425302] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:21,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:21,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:21,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708425149] [2025-04-26 16:22:21,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:22,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:22,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:22,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:22,021 INFO L87 Difference]: Start difference. First operand 1386 states and 3632 transitions. cyclomatic complexity: 2301 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:22,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:22,198 INFO L93 Difference]: Finished difference Result 1746 states and 4438 transitions. [2025-04-26 16:22:22,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1746 states and 4438 transitions. [2025-04-26 16:22:22,204 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 224 [2025-04-26 16:22:22,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1746 states to 1718 states and 4382 transitions. [2025-04-26 16:22:22,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1075 [2025-04-26 16:22:22,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1075 [2025-04-26 16:22:22,208 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1718 states and 4382 transitions. [2025-04-26 16:22:22,208 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:22,208 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1718 states and 4382 transitions. [2025-04-26 16:22:22,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states and 4382 transitions. [2025-04-26 16:22:22,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1402. [2025-04-26 16:22:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1402 states have (on average 2.6262482168330954) internal successors, (in total 3682), 1401 states have internal predecessors, (3682), 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:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 3682 transitions. [2025-04-26 16:22:22,232 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1402 states and 3682 transitions. [2025-04-26 16:22:22,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:22,233 INFO L438 stractBuchiCegarLoop]: Abstraction has 1402 states and 3682 transitions. [2025-04-26 16:22:22,233 INFO L340 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-04-26 16:22:22,233 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1402 states and 3682 transitions. [2025-04-26 16:22:22,236 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:22,236 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:22,236 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:22,236 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:22,236 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:22,237 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[107] L41-->L42: Formula: (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:22,237 INFO L754 eck$LassoCheckResult]: Loop: "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" [2025-04-26 16:22:22,237 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:22,237 INFO L85 PathProgramCache]: Analyzing trace with hash 115892191, now seen corresponding path program 6 times [2025-04-26 16:22:22,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:22,237 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962565246] [2025-04-26 16:22:22,237 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:22,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:22,238 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:22,240 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:22,240 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:22,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,240 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:22,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:22,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:22,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:22,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:22,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:22,242 INFO L85 PathProgramCache]: Analyzing trace with hash 57660507, now seen corresponding path program 14 times [2025-04-26 16:22:22,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:22,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579756589] [2025-04-26 16:22:22,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:22,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:22,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:22,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:22,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:22,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,244 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:22,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:22,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:22,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:22,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:22,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:22,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1696500167, now seen corresponding path program 9 times [2025-04-26 16:22:22,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:22,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559434960] [2025-04-26 16:22:22,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:22,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:22,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:22,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:22,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:22,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:22,367 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:22,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:22,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559434960] [2025-04-26 16:22:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559434960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:22,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:22,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:22,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825031887] [2025-04-26 16:22:22,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:22,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:22,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:22,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:22,405 INFO L87 Difference]: Start difference. First operand 1402 states and 3682 transitions. cyclomatic complexity: 2335 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:22,660 INFO L93 Difference]: Finished difference Result 2017 states and 5138 transitions. [2025-04-26 16:22:22,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2017 states and 5138 transitions. [2025-04-26 16:22:22,667 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 224 [2025-04-26 16:22:22,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2017 states to 1989 states and 5082 transitions. [2025-04-26 16:22:22,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1162 [2025-04-26 16:22:22,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1162 [2025-04-26 16:22:22,673 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1989 states and 5082 transitions. [2025-04-26 16:22:22,673 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:22,673 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1989 states and 5082 transitions. [2025-04-26 16:22:22,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states and 5082 transitions. [2025-04-26 16:22:22,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1407. [2025-04-26 16:22:22,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1407 states have (on average 2.6226012793176974) internal successors, (in total 3690), 1406 states have internal predecessors, (3690), 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:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 3690 transitions. [2025-04-26 16:22:22,690 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1407 states and 3690 transitions. [2025-04-26 16:22:22,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:22,691 INFO L438 stractBuchiCegarLoop]: Abstraction has 1407 states and 3690 transitions. [2025-04-26 16:22:22,691 INFO L340 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2025-04-26 16:22:22,691 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1407 states and 3690 transitions. [2025-04-26 16:22:22,694 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:22,694 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:22,694 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:22,695 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:22,695 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:22,695 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:22,695 INFO L754 eck$LassoCheckResult]: Loop: "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:22:22,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:22,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1633265258, now seen corresponding path program 6 times [2025-04-26 16:22:22,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:22,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577174880] [2025-04-26 16:22:22,695 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:22,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:22,697 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:22,697 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:22,697 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:22,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,698 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:22,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:22,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:22,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:22,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:22,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:22,700 INFO L85 PathProgramCache]: Analyzing trace with hash -53527749, now seen corresponding path program 16 times [2025-04-26 16:22:22,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:22,700 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129969430] [2025-04-26 16:22:22,700 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:22,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:22,701 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:22:22,702 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:22,702 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:22,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,702 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:22,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:22,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:22,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:22,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:22,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:22,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1411305520, now seen corresponding path program 13 times [2025-04-26 16:22:22,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:22,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169120825] [2025-04-26 16:22:22,703 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:22,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:22,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:22,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:22,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:22,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:22,821 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:22,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:22,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169120825] [2025-04-26 16:22:22,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169120825] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:22,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:22,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:22,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027477947] [2025-04-26 16:22:22,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:22,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:22,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:22,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:22,859 INFO L87 Difference]: Start difference. First operand 1407 states and 3690 transitions. cyclomatic complexity: 2338 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:23,085 INFO L93 Difference]: Finished difference Result 1680 states and 4318 transitions. [2025-04-26 16:22:23,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1680 states and 4318 transitions. [2025-04-26 16:22:23,091 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:23,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1680 states to 1652 states and 4262 transitions. [2025-04-26 16:22:23,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1057 [2025-04-26 16:22:23,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1057 [2025-04-26 16:22:23,095 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1652 states and 4262 transitions. [2025-04-26 16:22:23,095 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:23,095 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1652 states and 4262 transitions. [2025-04-26 16:22:23,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states and 4262 transitions. [2025-04-26 16:22:23,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1380. [2025-04-26 16:22:23,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1380 states have (on average 2.628260869565217) internal successors, (in total 3627), 1379 states have internal predecessors, (3627), 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:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 3627 transitions. [2025-04-26 16:22:23,108 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1380 states and 3627 transitions. [2025-04-26 16:22:23,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:23,109 INFO L438 stractBuchiCegarLoop]: Abstraction has 1380 states and 3627 transitions. [2025-04-26 16:22:23,109 INFO L340 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2025-04-26 16:22:23,109 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1380 states and 3627 transitions. [2025-04-26 16:22:23,112 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:23,112 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:23,112 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:23,112 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:23,112 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:23,112 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[107] L41-->L42: Formula: (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:23,112 INFO L754 eck$LassoCheckResult]: Loop: "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" [2025-04-26 16:22:23,113 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,113 INFO L85 PathProgramCache]: Analyzing trace with hash 588242911, now seen corresponding path program 7 times [2025-04-26 16:22:23,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,113 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395628640] [2025-04-26 16:22:23,113 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:23,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:23,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:23,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,115 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:23,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:23,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:23,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,117 INFO L85 PathProgramCache]: Analyzing trace with hash 57660507, now seen corresponding path program 15 times [2025-04-26 16:22:23,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907765417] [2025-04-26 16:22:23,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:23,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:23,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:23,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:23,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,119 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:23,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:23,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:23,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,121 INFO L85 PathProgramCache]: Analyzing trace with hash -678889927, now seen corresponding path program 10 times [2025-04-26 16:22:23,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670241084] [2025-04-26 16:22:23,121 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:23,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,123 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-26 16:22:23,124 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:23,124 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-26 16:22:23,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:23,222 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:23,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:23,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670241084] [2025-04-26 16:22:23,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670241084] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:23,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:23,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:23,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644900940] [2025-04-26 16:22:23,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:23,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:23,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:23,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:23,261 INFO L87 Difference]: Start difference. First operand 1380 states and 3627 transitions. cyclomatic complexity: 2302 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:23,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:23,431 INFO L93 Difference]: Finished difference Result 1637 states and 4208 transitions. [2025-04-26 16:22:23,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1637 states and 4208 transitions. [2025-04-26 16:22:23,437 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 224 [2025-04-26 16:22:23,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1637 states to 1609 states and 4152 transitions. [2025-04-26 16:22:23,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1037 [2025-04-26 16:22:23,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1037 [2025-04-26 16:22:23,441 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1609 states and 4152 transitions. [2025-04-26 16:22:23,441 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:23,441 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1609 states and 4152 transitions. [2025-04-26 16:22:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states and 4152 transitions. [2025-04-26 16:22:23,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1376. [2025-04-26 16:22:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1376 states have (on average 2.6286337209302326) internal successors, (in total 3617), 1375 states have internal predecessors, (3617), 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:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 3617 transitions. [2025-04-26 16:22:23,454 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1376 states and 3617 transitions. [2025-04-26 16:22:23,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:23,455 INFO L438 stractBuchiCegarLoop]: Abstraction has 1376 states and 3617 transitions. [2025-04-26 16:22:23,455 INFO L340 stractBuchiCegarLoop]: ======== Iteration 32 ============ [2025-04-26 16:22:23,455 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1376 states and 3617 transitions. [2025-04-26 16:22:23,458 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:23,458 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:23,458 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:23,458 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:23,458 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:23,458 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:23,459 INFO L754 eck$LassoCheckResult]: Loop: "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:22:23,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,459 INFO L85 PathProgramCache]: Analyzing trace with hash -693719612, now seen corresponding path program 7 times [2025-04-26 16:22:23,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212546907] [2025-04-26 16:22:23,459 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:23,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:23,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:23,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,461 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:23,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:23,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:23,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,463 INFO L85 PathProgramCache]: Analyzing trace with hash -53527749, now seen corresponding path program 17 times [2025-04-26 16:22:23,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,463 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441989521] [2025-04-26 16:22:23,463 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:23,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,464 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:23,465 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:23,465 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:23,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,465 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:23,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:23,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:23,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,467 INFO L85 PathProgramCache]: Analyzing trace with hash -57051650, now seen corresponding path program 14 times [2025-04-26 16:22:23,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,467 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949174109] [2025-04-26 16:22:23,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:23,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:23,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:23,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:23,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:23,598 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:23,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:23,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949174109] [2025-04-26 16:22:23,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949174109] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:23,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:23,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:23,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33011091] [2025-04-26 16:22:23,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:23,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:23,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:23,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:23,657 INFO L87 Difference]: Start difference. First operand 1376 states and 3617 transitions. cyclomatic complexity: 2296 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:23,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:23,885 INFO L93 Difference]: Finished difference Result 1996 states and 5045 transitions. [2025-04-26 16:22:23,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1996 states and 5045 transitions. [2025-04-26 16:22:23,891 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:23,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1996 states to 1968 states and 4989 transitions. [2025-04-26 16:22:23,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1184 [2025-04-26 16:22:23,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1184 [2025-04-26 16:22:23,896 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1968 states and 4989 transitions. [2025-04-26 16:22:23,896 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:23,897 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1968 states and 4989 transitions. [2025-04-26 16:22:23,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states and 4989 transitions. [2025-04-26 16:22:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1383. [2025-04-26 16:22:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1383 states have (on average 2.631236442516269) internal successors, (in total 3639), 1382 states have internal predecessors, (3639), 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:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 3639 transitions. [2025-04-26 16:22:23,911 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1383 states and 3639 transitions. [2025-04-26 16:22:23,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-26 16:22:23,913 INFO L438 stractBuchiCegarLoop]: Abstraction has 1383 states and 3639 transitions. [2025-04-26 16:22:23,913 INFO L340 stractBuchiCegarLoop]: ======== Iteration 33 ============ [2025-04-26 16:22:23,913 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1383 states and 3639 transitions. [2025-04-26 16:22:23,916 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:23,916 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:23,916 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:23,916 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:23,917 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:23,917 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:23,917 INFO L754 eck$LassoCheckResult]: Loop: "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:22:23,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,917 INFO L85 PathProgramCache]: Analyzing trace with hash -693928862, now seen corresponding path program 8 times [2025-04-26 16:22:23,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,917 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108271422] [2025-04-26 16:22:23,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:23,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:23,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:23,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:23,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,919 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:23,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:23,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:23,921 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,921 INFO L85 PathProgramCache]: Analyzing trace with hash -53527749, now seen corresponding path program 18 times [2025-04-26 16:22:23,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073874028] [2025-04-26 16:22:23,921 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:23,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,923 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:23,923 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:23,923 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:23,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,923 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:23,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:23,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:23,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,925 INFO L85 PathProgramCache]: Analyzing trace with hash -735787364, now seen corresponding path program 15 times [2025-04-26 16:22:23,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636861335] [2025-04-26 16:22:23,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:23,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,927 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:23,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:23,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:23,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:24,052 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:24,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:24,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636861335] [2025-04-26 16:22:24,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636861335] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:24,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:24,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:24,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352192637] [2025-04-26 16:22:24,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:24,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:24,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:24,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:24,092 INFO L87 Difference]: Start difference. First operand 1383 states and 3639 transitions. cyclomatic complexity: 2311 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:24,340 INFO L93 Difference]: Finished difference Result 2102 states and 5311 transitions. [2025-04-26 16:22:24,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2102 states and 5311 transitions. [2025-04-26 16:22:24,347 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:24,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2102 states to 2074 states and 5255 transitions. [2025-04-26 16:22:24,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1245 [2025-04-26 16:22:24,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1245 [2025-04-26 16:22:24,353 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2074 states and 5255 transitions. [2025-04-26 16:22:24,353 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:24,353 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2074 states and 5255 transitions. [2025-04-26 16:22:24,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states and 5255 transitions. [2025-04-26 16:22:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 1380. [2025-04-26 16:22:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1380 states have (on average 2.628260869565217) internal successors, (in total 3627), 1379 states have internal predecessors, (3627), 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:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 3627 transitions. [2025-04-26 16:22:24,375 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1380 states and 3627 transitions. [2025-04-26 16:22:24,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:24,376 INFO L438 stractBuchiCegarLoop]: Abstraction has 1380 states and 3627 transitions. [2025-04-26 16:22:24,376 INFO L340 stractBuchiCegarLoop]: ======== Iteration 34 ============ [2025-04-26 16:22:24,376 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1380 states and 3627 transitions. [2025-04-26 16:22:24,379 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:24,379 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:24,379 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:24,380 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:24,380 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:24,380 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[107] L41-->L42: Formula: (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:24,380 INFO L754 eck$LassoCheckResult]: Loop: "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" [2025-04-26 16:22:24,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:24,380 INFO L85 PathProgramCache]: Analyzing trace with hash -507447043, now seen corresponding path program 8 times [2025-04-26 16:22:24,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:24,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483977124] [2025-04-26 16:22:24,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:24,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:24,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:24,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:24,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:24,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,382 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:24,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:24,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:24,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:24,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:24,384 INFO L85 PathProgramCache]: Analyzing trace with hash 57660507, now seen corresponding path program 16 times [2025-04-26 16:22:24,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:24,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774799868] [2025-04-26 16:22:24,384 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:24,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:24,386 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:22:24,386 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:24,386 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:24,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,386 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:24,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:24,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:24,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:24,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:24,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1679167831, now seen corresponding path program 11 times [2025-04-26 16:22:24,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:24,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445869721] [2025-04-26 16:22:24,388 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:24,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:24,389 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:24,390 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:24,390 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:24,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:24,525 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:24,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:24,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445869721] [2025-04-26 16:22:24,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445869721] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:24,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:24,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:24,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736705669] [2025-04-26 16:22:24,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:24,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:24,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:24,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:24,566 INFO L87 Difference]: Start difference. First operand 1380 states and 3627 transitions. cyclomatic complexity: 2302 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:24,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:24,830 INFO L93 Difference]: Finished difference Result 2231 states and 5678 transitions. [2025-04-26 16:22:24,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2231 states and 5678 transitions. [2025-04-26 16:22:24,841 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 224 [2025-04-26 16:22:24,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2231 states to 2203 states and 5622 transitions. [2025-04-26 16:22:24,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1283 [2025-04-26 16:22:24,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1283 [2025-04-26 16:22:24,849 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2203 states and 5622 transitions. [2025-04-26 16:22:24,849 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:24,849 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2203 states and 5622 transitions. [2025-04-26 16:22:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states and 5622 transitions. [2025-04-26 16:22:24,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 1391. [2025-04-26 16:22:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1391 states have (on average 2.6376707404744786) internal successors, (in total 3669), 1390 states have internal predecessors, (3669), 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:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 3669 transitions. [2025-04-26 16:22:24,865 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1391 states and 3669 transitions. [2025-04-26 16:22:24,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:24,866 INFO L438 stractBuchiCegarLoop]: Abstraction has 1391 states and 3669 transitions. [2025-04-26 16:22:24,866 INFO L340 stractBuchiCegarLoop]: ======== Iteration 35 ============ [2025-04-26 16:22:24,866 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1391 states and 3669 transitions. [2025-04-26 16:22:24,869 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:24,869 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:24,869 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:24,869 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:24,869 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:24,870 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:24,870 INFO L754 eck$LassoCheckResult]: Loop: "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:22:24,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:24,870 INFO L85 PathProgramCache]: Analyzing trace with hash -699291242, now seen corresponding path program 9 times [2025-04-26 16:22:24,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:24,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167553892] [2025-04-26 16:22:24,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:24,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:24,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:24,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:24,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:24,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,872 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:24,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:24,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:24,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:24,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:24,874 INFO L85 PathProgramCache]: Analyzing trace with hash -53527749, now seen corresponding path program 19 times [2025-04-26 16:22:24,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:24,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302755156] [2025-04-26 16:22:24,874 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:24,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:24,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:24,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:24,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,878 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:24,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:24,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:24,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:24,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:24,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1799126992, now seen corresponding path program 16 times [2025-04-26 16:22:24,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:24,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959907838] [2025-04-26 16:22:24,880 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:24,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:24,881 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-26 16:22:24,882 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:24,882 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-26 16:22:24,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:24,998 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:24,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:24,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959907838] [2025-04-26 16:22:24,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959907838] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:24,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:24,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:24,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034787088] [2025-04-26 16:22:24,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:25,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:25,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:25,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:25,029 INFO L87 Difference]: Start difference. First operand 1391 states and 3669 transitions. cyclomatic complexity: 2333 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:25,206 INFO L93 Difference]: Finished difference Result 1841 states and 4683 transitions. [2025-04-26 16:22:25,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1841 states and 4683 transitions. [2025-04-26 16:22:25,212 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:25,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1841 states to 1813 states and 4627 transitions. [2025-04-26 16:22:25,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1101 [2025-04-26 16:22:25,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1101 [2025-04-26 16:22:25,217 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1813 states and 4627 transitions. [2025-04-26 16:22:25,217 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:25,217 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1813 states and 4627 transitions. [2025-04-26 16:22:25,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states and 4627 transitions. [2025-04-26 16:22:25,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1376. [2025-04-26 16:22:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1376 states have (on average 2.6438953488372094) internal successors, (in total 3638), 1375 states have internal predecessors, (3638), 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:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 3638 transitions. [2025-04-26 16:22:25,232 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1376 states and 3638 transitions. [2025-04-26 16:22:25,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:25,233 INFO L438 stractBuchiCegarLoop]: Abstraction has 1376 states and 3638 transitions. [2025-04-26 16:22:25,233 INFO L340 stractBuchiCegarLoop]: ======== Iteration 36 ============ [2025-04-26 16:22:25,233 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1376 states and 3638 transitions. [2025-04-26 16:22:25,236 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:25,236 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:25,236 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:25,236 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:25,236 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:25,237 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[107] L41-->L42: Formula: (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:25,237 INFO L754 eck$LassoCheckResult]: Loop: "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" [2025-04-26 16:22:25,237 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:25,237 INFO L85 PathProgramCache]: Analyzing trace with hash -507908323, now seen corresponding path program 9 times [2025-04-26 16:22:25,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:25,237 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460368006] [2025-04-26 16:22:25,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:25,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:25,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:25,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:25,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:25,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:25,240 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:25,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:25,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:25,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:25,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:25,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:25,242 INFO L85 PathProgramCache]: Analyzing trace with hash 57660507, now seen corresponding path program 17 times [2025-04-26 16:22:25,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:25,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949254621] [2025-04-26 16:22:25,242 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:25,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:25,243 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:25,244 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:25,244 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:25,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:25,244 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:25,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:25,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:25,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:25,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:25,246 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:25,246 INFO L85 PathProgramCache]: Analyzing trace with hash 927393655, now seen corresponding path program 12 times [2025-04-26 16:22:25,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:25,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697890854] [2025-04-26 16:22:25,246 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:25,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:25,247 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:25,248 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:25,248 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:25,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:25,374 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:25,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:25,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697890854] [2025-04-26 16:22:25,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697890854] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:25,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:25,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:25,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290600536] [2025-04-26 16:22:25,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:25,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:25,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:25,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:25,411 INFO L87 Difference]: Start difference. First operand 1376 states and 3638 transitions. cyclomatic complexity: 2317 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:25,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:25,725 INFO L93 Difference]: Finished difference Result 2446 states and 6188 transitions. [2025-04-26 16:22:25,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2446 states and 6188 transitions. [2025-04-26 16:22:25,734 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 224 [2025-04-26 16:22:25,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2446 states to 2418 states and 6132 transitions. [2025-04-26 16:22:25,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1334 [2025-04-26 16:22:25,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1334 [2025-04-26 16:22:25,741 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2418 states and 6132 transitions. [2025-04-26 16:22:25,741 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:25,741 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2418 states and 6132 transitions. [2025-04-26 16:22:25,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states and 6132 transitions. [2025-04-26 16:22:25,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 1375. [2025-04-26 16:22:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1375 states have (on average 2.6436363636363636) internal successors, (in total 3635), 1374 states have internal predecessors, (3635), 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:25,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 3635 transitions. [2025-04-26 16:22:25,759 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1375 states and 3635 transitions. [2025-04-26 16:22:25,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-26 16:22:25,760 INFO L438 stractBuchiCegarLoop]: Abstraction has 1375 states and 3635 transitions. [2025-04-26 16:22:25,760 INFO L340 stractBuchiCegarLoop]: ======== Iteration 37 ============ [2025-04-26 16:22:25,760 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1375 states and 3635 transitions. [2025-04-26 16:22:25,763 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:25,763 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:25,763 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:25,763 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:25,763 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:25,764 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[113] L54-->L57: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:22:25,764 INFO L754 eck$LassoCheckResult]: Loop: "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" [2025-04-26 16:22:25,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:25,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2049567273, now seen corresponding path program 1 times [2025-04-26 16:22:25,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:25,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457525241] [2025-04-26 16:22:25,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:25,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:25,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:25,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:25,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:25,767 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:25,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:25,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:25,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:25,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:25,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:25,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1432205049, now seen corresponding path program 20 times [2025-04-26 16:22:25,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:25,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223940047] [2025-04-26 16:22:25,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:25,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:25,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:25,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:25,771 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:25,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:25,771 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:25,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:25,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:25,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:25,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:25,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:25,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2000148259, now seen corresponding path program 2 times [2025-04-26 16:22:25,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:25,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567820216] [2025-04-26 16:22:25,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:25,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:25,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:25,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:25,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:25,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:25,776 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:25,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:25,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:25,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:25,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:25,932 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:25,932 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:25,932 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:25,932 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:25,932 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:25,932 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:25,932 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:25,932 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:25,932 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration37_Lasso [2025-04-26 16:22:25,932 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:25,932 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:25,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:25,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:25,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:25,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:25,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:25,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:25,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:25,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:26,130 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:26,130 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:26,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,146 INFO L229 MonitoredProcess]: Starting monitored process 341 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:26,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (341)] Waiting until timeout for monitored process [2025-04-26 16:22:26,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:26,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:26,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:26,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:26,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:26,159 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (341)] Ended with exit code 0 [2025-04-26 16:22:26,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,166 INFO L229 MonitoredProcess]: Starting monitored process 342 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:26,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (342)] Waiting until timeout for monitored process [2025-04-26 16:22:26,168 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:26,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,178 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:26,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:26,185 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:22:26,185 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:26,203 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (342)] Ended with exit code 0 [2025-04-26 16:22:26,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,211 INFO L229 MonitoredProcess]: Starting monitored process 343 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:26,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (343)] Waiting until timeout for monitored process [2025-04-26 16:22:26,212 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:26,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:26,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:26,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:26,224 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (343)] Ended with exit code 0 [2025-04-26 16:22:26,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,231 INFO L229 MonitoredProcess]: Starting monitored process 344 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:26,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (344)] Waiting until timeout for monitored process [2025-04-26 16:22:26,232 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:26,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:26,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:26,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:26,245 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (344)] Ended with exit code 0 [2025-04-26 16:22:26,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,252 INFO L229 MonitoredProcess]: Starting monitored process 345 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:26,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (345)] Waiting until timeout for monitored process [2025-04-26 16:22:26,253 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:26,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:26,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:26,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:26,265 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (345)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:26,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,272 INFO L229 MonitoredProcess]: Starting monitored process 346 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:26,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (346)] Waiting until timeout for monitored process [2025-04-26 16:22:26,274 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:26,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:26,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:26,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:26,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:26,285 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (346)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:26,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,292 INFO L229 MonitoredProcess]: Starting monitored process 347 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:26,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (347)] Waiting until timeout for monitored process [2025-04-26 16:22:26,293 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:26,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:26,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:26,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:26,306 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (347)] Ended with exit code 0 [2025-04-26 16:22:26,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,313 INFO L229 MonitoredProcess]: Starting monitored process 348 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:26,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (348)] Waiting until timeout for monitored process [2025-04-26 16:22:26,314 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:26,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:26,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:26,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:26,327 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (348)] Ended with exit code 0 [2025-04-26 16:22:26,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,334 INFO L229 MonitoredProcess]: Starting monitored process 349 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:26,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (349)] Waiting until timeout for monitored process [2025-04-26 16:22:26,336 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:26,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:26,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:26,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:26,349 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (349)] Ended with exit code 0 [2025-04-26 16:22:26,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,357 INFO L229 MonitoredProcess]: Starting monitored process 350 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:26,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (350)] Waiting until timeout for monitored process [2025-04-26 16:22:26,358 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:26,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:26,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:26,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:26,371 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (350)] Ended with exit code 0 [2025-04-26 16:22:26,376 INFO L453 LassoAnalysis]: Using template '2-nested'. [2025-04-26 16:22:26,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,378 INFO L229 MonitoredProcess]: Starting monitored process 351 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:26,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (351)] Waiting until timeout for monitored process [2025-04-26 16:22:26,392 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:26,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:26,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,402 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:26,402 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:22:26,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:26,404 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (351)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:26,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,412 INFO L229 MonitoredProcess]: Starting monitored process 352 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:26,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (352)] Waiting until timeout for monitored process [2025-04-26 16:22:26,413 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:26,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,423 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:26,423 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:26,432 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:22:26,432 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:26,461 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (352)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:26,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,469 INFO L229 MonitoredProcess]: Starting monitored process 353 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:26,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (353)] Waiting until timeout for monitored process [2025-04-26 16:22:26,471 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:26,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,481 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:26,482 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:26,482 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:26,485 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (353)] Ended with exit code 0 [2025-04-26 16:22:26,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,492 INFO L229 MonitoredProcess]: Starting monitored process 354 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:26,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (354)] Waiting until timeout for monitored process [2025-04-26 16:22:26,495 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:26,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,505 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:26,506 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:26,507 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:26,510 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (354)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:26,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,518 INFO L229 MonitoredProcess]: Starting monitored process 355 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:26,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (355)] Waiting until timeout for monitored process [2025-04-26 16:22:26,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:26,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,529 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:26,530 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:26,530 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:26,533 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (355)] Ended with exit code 0 [2025-04-26 16:22:26,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,540 INFO L229 MonitoredProcess]: Starting monitored process 356 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:26,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (356)] Waiting until timeout for monitored process [2025-04-26 16:22:26,541 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:26,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:26,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,552 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:26,552 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:22:26,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:26,553 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (356)] Ended with exit code 0 [2025-04-26 16:22:26,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,560 INFO L229 MonitoredProcess]: Starting monitored process 357 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:26,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (357)] Waiting until timeout for monitored process [2025-04-26 16:22:26,562 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:26,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,572 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:26,572 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:26,573 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:26,575 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (357)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:26,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,582 INFO L229 MonitoredProcess]: Starting monitored process 358 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:26,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (358)] Waiting until timeout for monitored process [2025-04-26 16:22:26,584 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:26,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,593 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:26,594 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:26,594 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:26,597 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (358)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:26,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,605 INFO L229 MonitoredProcess]: Starting monitored process 359 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:26,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (359)] Waiting until timeout for monitored process [2025-04-26 16:22:26,606 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:26,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,616 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:26,618 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:26,618 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:26,621 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (359)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:26,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,628 INFO L229 MonitoredProcess]: Starting monitored process 360 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:26,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (360)] Waiting until timeout for monitored process [2025-04-26 16:22:26,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:26,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,639 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:26,639 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:26,639 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:26,642 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (360)] Ended with exit code 0 [2025-04-26 16:22:26,648 INFO L453 LassoAnalysis]: Using template '3-nested'. [2025-04-26 16:22:26,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,650 INFO L229 MonitoredProcess]: Starting monitored process 361 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:26,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (361)] Waiting until timeout for monitored process [2025-04-26 16:22:26,651 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:26,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:26,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,661 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:26,662 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:22:26,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:26,663 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (361)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:26,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,669 INFO L229 MonitoredProcess]: Starting monitored process 362 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:26,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (362)] Waiting until timeout for monitored process [2025-04-26 16:22:26,671 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:26,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,681 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:26,681 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:26,694 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2025-04-26 16:22:26,694 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:22:26,729 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (362)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:26,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,737 INFO L229 MonitoredProcess]: Starting monitored process 363 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:26,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (363)] Waiting until timeout for monitored process [2025-04-26 16:22:26,739 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:26,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,748 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:26,749 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:26,749 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:26,753 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (363)] Ended with exit code 0 [2025-04-26 16:22:26,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,760 INFO L229 MonitoredProcess]: Starting monitored process 364 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:26,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (364)] Waiting until timeout for monitored process [2025-04-26 16:22:26,762 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:26,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,771 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:26,773 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:26,773 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:26,777 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (364)] Ended with exit code 0 [2025-04-26 16:22:26,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,784 INFO L229 MonitoredProcess]: Starting monitored process 365 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:26,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (365)] Waiting until timeout for monitored process [2025-04-26 16:22:26,785 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:26,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,795 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:26,796 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:26,796 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:26,799 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (365)] Ended with exit code 0 [2025-04-26 16:22:26,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,806 INFO L229 MonitoredProcess]: Starting monitored process 366 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:26,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (366)] Waiting until timeout for monitored process [2025-04-26 16:22:26,808 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:26,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:26,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,818 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:26,818 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:22:26,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:26,819 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (366)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:26,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,826 INFO L229 MonitoredProcess]: Starting monitored process 367 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:26,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (367)] Waiting until timeout for monitored process [2025-04-26 16:22:26,827 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:26,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,837 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:26,838 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:26,838 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:26,841 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (367)] Ended with exit code 0 [2025-04-26 16:22:26,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,848 INFO L229 MonitoredProcess]: Starting monitored process 368 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:26,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (368)] Waiting until timeout for monitored process [2025-04-26 16:22:26,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:22:26,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,860 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:26,861 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:26,861 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:26,864 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (368)] Ended with exit code 0 [2025-04-26 16:22:26,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,871 INFO L229 MonitoredProcess]: Starting monitored process 369 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:26,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (369)] Waiting until timeout for monitored process [2025-04-26 16:22:26,873 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:26,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,882 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:26,883 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:26,883 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:26,887 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (369)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:26,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,895 INFO L229 MonitoredProcess]: Starting monitored process 370 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:26,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (370)] Waiting until timeout for monitored process [2025-04-26 16:22:26,896 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:26,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,907 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:26,908 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:26,908 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:26,911 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (370)] Ended with exit code 0 [2025-04-26 16:22:26,917 INFO L453 LassoAnalysis]: Using template '4-nested'. [2025-04-26 16:22:26,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,919 INFO L229 MonitoredProcess]: Starting monitored process 371 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:26,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (371)] Waiting until timeout for monitored process [2025-04-26 16:22:26,920 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:26,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:26,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,931 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:26,931 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:22:26,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:26,933 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (371)] Ended with exit code 0 [2025-04-26 16:22:26,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,942 INFO L229 MonitoredProcess]: Starting monitored process 372 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:26,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (372)] Waiting until timeout for monitored process [2025-04-26 16:22:26,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:22:26,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,954 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:26,954 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:26,969 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2025-04-26 16:22:26,969 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2025-04-26 16:22:27,012 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (372)] Ended with exit code 0 [2025-04-26 16:22:27,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,023 INFO L229 MonitoredProcess]: Starting monitored process 373 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:27,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (373)] Waiting until timeout for monitored process [2025-04-26 16:22:27,024 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:27,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:27,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,034 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:27,036 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:27,036 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:27,040 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (373)] Ended with exit code 0 [2025-04-26 16:22:27,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,048 INFO L229 MonitoredProcess]: Starting monitored process 374 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:27,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (374)] Waiting until timeout for monitored process [2025-04-26 16:22:27,049 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:27,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:27,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,060 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:27,061 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:27,061 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:27,066 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (374)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:27,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,076 INFO L229 MonitoredProcess]: Starting monitored process 375 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:27,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (375)] Waiting until timeout for monitored process [2025-04-26 16:22:27,077 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:27,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:27,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,087 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:27,089 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:27,089 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:27,093 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (375)] Ended with exit code 0 [2025-04-26 16:22:27,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,104 INFO L229 MonitoredProcess]: Starting monitored process 376 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:27,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (376)] Waiting until timeout for monitored process [2025-04-26 16:22:27,113 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:27,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:27,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:27,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,123 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:27,123 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:22:27,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:27,125 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (376)] Ended with exit code 0 [2025-04-26 16:22:27,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,132 INFO L229 MonitoredProcess]: Starting monitored process 377 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:27,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (377)] Waiting until timeout for monitored process [2025-04-26 16:22:27,133 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:27,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:27,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,143 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:27,145 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:27,145 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:27,149 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (377)] Ended with exit code 0 [2025-04-26 16:22:27,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,156 INFO L229 MonitoredProcess]: Starting monitored process 378 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:27,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (378)] Waiting until timeout for monitored process [2025-04-26 16:22:27,158 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:27,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:27,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,168 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:27,169 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:27,169 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:27,173 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (378)] Ended with exit code 0 [2025-04-26 16:22:27,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,180 INFO L229 MonitoredProcess]: Starting monitored process 379 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:27,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (379)] Waiting until timeout for monitored process [2025-04-26 16:22:27,182 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:27,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:27,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,192 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:27,193 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:27,193 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:27,198 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (379)] Ended with exit code 0 [2025-04-26 16:22:27,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,205 INFO L229 MonitoredProcess]: Starting monitored process 380 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:27,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (380)] Waiting until timeout for monitored process [2025-04-26 16:22:27,207 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:27,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:27,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,217 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:27,218 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:27,218 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:27,222 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (380)] Ended with exit code 0 [2025-04-26 16:22:27,229 INFO L453 LassoAnalysis]: Using template '2-phase'. [2025-04-26 16:22:27,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,231 INFO L229 MonitoredProcess]: Starting monitored process 381 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:27,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (381)] Waiting until timeout for monitored process [2025-04-26 16:22:27,234 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:27,246 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,246 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:27,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:27,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,246 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:27,247 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:22:27,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:27,251 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (381)] Ended with exit code 0 [2025-04-26 16:22:27,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,259 INFO L229 MonitoredProcess]: Starting monitored process 382 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:27,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (382)] Waiting until timeout for monitored process [2025-04-26 16:22:27,261 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:27,272 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,272 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:27,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,272 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:27,272 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:27,281 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:22:27,281 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:27,313 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (382)] Ended with exit code 0 [2025-04-26 16:22:27,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,320 INFO L229 MonitoredProcess]: Starting monitored process 383 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:27,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (383)] Waiting until timeout for monitored process [2025-04-26 16:22:27,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:22:27,332 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,332 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:27,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,332 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:27,333 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:27,333 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:27,337 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (383)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:27,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,344 INFO L229 MonitoredProcess]: Starting monitored process 384 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:27,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (384)] Waiting until timeout for monitored process [2025-04-26 16:22:27,347 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:27,356 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,356 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:27,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,356 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:27,358 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:27,358 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:27,362 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (384)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:27,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,370 INFO L229 MonitoredProcess]: Starting monitored process 385 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:27,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (385)] Waiting until timeout for monitored process [2025-04-26 16:22:27,382 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:27,392 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,392 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:27,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,392 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:27,393 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:27,393 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:27,396 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (385)] Ended with exit code 0 [2025-04-26 16:22:27,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,404 INFO L229 MonitoredProcess]: Starting monitored process 386 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:27,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (386)] Waiting until timeout for monitored process [2025-04-26 16:22:27,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:22:27,415 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,415 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:27,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:27,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,415 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:27,415 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:22:27,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:27,417 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (386)] Ended with exit code 0 [2025-04-26 16:22:27,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,424 INFO L229 MonitoredProcess]: Starting monitored process 387 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:27,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (387)] Waiting until timeout for monitored process [2025-04-26 16:22:27,425 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:27,435 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,435 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:27,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,435 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:27,436 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:27,436 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:27,439 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (387)] Ended with exit code 0 [2025-04-26 16:22:27,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,446 INFO L229 MonitoredProcess]: Starting monitored process 388 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:27,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (388)] Waiting until timeout for monitored process [2025-04-26 16:22:27,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:22:27,457 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,457 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:27,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,457 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:27,458 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:27,458 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:27,461 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (388)] Ended with exit code 0 [2025-04-26 16:22:27,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,468 INFO L229 MonitoredProcess]: Starting monitored process 389 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:27,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (389)] Waiting until timeout for monitored process [2025-04-26 16:22:27,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:22:27,479 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,479 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:27,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,479 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:27,480 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:27,480 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:27,483 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (389)] Ended with exit code 0 [2025-04-26 16:22:27,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,490 INFO L229 MonitoredProcess]: Starting monitored process 390 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:27,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (390)] Waiting until timeout for monitored process [2025-04-26 16:22:27,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:22:27,501 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,501 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:27,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,501 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:27,502 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:27,502 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:27,505 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (390)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:27,511 INFO L453 LassoAnalysis]: Using template '3-phase'. [2025-04-26 16:22:27,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,512 INFO L229 MonitoredProcess]: Starting monitored process 391 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:27,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (391)] Waiting until timeout for monitored process [2025-04-26 16:22:27,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:22:27,523 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,524 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:27,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:27,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,524 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:27,524 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:22:27,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:27,526 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (391)] Ended with exit code 0 [2025-04-26 16:22:27,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,533 INFO L229 MonitoredProcess]: Starting monitored process 392 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:27,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (392)] Waiting until timeout for monitored process [2025-04-26 16:22:27,535 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:27,545 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,545 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:27,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,545 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:27,545 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:27,557 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2025-04-26 16:22:27,557 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:22:27,595 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (392)] Ended with exit code 0 [2025-04-26 16:22:27,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,603 INFO L229 MonitoredProcess]: Starting monitored process 393 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:27,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (393)] Waiting until timeout for monitored process [2025-04-26 16:22:27,605 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:27,615 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,615 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:27,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,615 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:27,616 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:27,616 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:27,621 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (393)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:27,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,628 INFO L229 MonitoredProcess]: Starting monitored process 394 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:27,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (394)] Waiting until timeout for monitored process [2025-04-26 16:22:27,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:27,639 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,639 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:27,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,639 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:27,641 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:27,641 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:27,646 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (394)] Ended with exit code 0 [2025-04-26 16:22:27,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,653 INFO L229 MonitoredProcess]: Starting monitored process 395 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:27,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (395)] Waiting until timeout for monitored process [2025-04-26 16:22:27,655 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:27,664 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,665 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:27,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,665 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:27,666 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:27,666 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:27,671 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (395)] Ended with exit code 0 [2025-04-26 16:22:27,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,677 INFO L229 MonitoredProcess]: Starting monitored process 396 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:27,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (396)] Waiting until timeout for monitored process [2025-04-26 16:22:27,679 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:27,689 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,689 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:27,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:27,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,689 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:27,690 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:22:27,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:27,692 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (396)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:27,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,699 INFO L229 MonitoredProcess]: Starting monitored process 397 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:27,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (397)] Waiting until timeout for monitored process [2025-04-26 16:22:27,701 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:27,710 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,710 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:27,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,711 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:27,712 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:27,712 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:27,717 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (397)] Ended with exit code 0 [2025-04-26 16:22:27,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,724 INFO L229 MonitoredProcess]: Starting monitored process 398 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:27,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (398)] Waiting until timeout for monitored process [2025-04-26 16:22:27,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:22:27,735 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,735 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:27,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,735 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:27,737 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:27,737 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:27,742 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (398)] Ended with exit code 0 [2025-04-26 16:22:27,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,749 INFO L229 MonitoredProcess]: Starting monitored process 399 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:27,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (399)] Waiting until timeout for monitored process [2025-04-26 16:22:27,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:22:27,760 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,760 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:27,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,760 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:27,761 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:27,762 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:27,766 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (399)] Ended with exit code 0 [2025-04-26 16:22:27,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,773 INFO L229 MonitoredProcess]: Starting monitored process 400 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:27,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (400)] Waiting until timeout for monitored process [2025-04-26 16:22:27,775 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:27,785 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,785 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:27,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,785 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:27,786 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:27,786 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:27,791 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (400)] Ended with exit code 0 [2025-04-26 16:22:27,796 INFO L453 LassoAnalysis]: Using template '4-phase'. [2025-04-26 16:22:27,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,798 INFO L229 MonitoredProcess]: Starting monitored process 401 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:27,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (401)] Waiting until timeout for monitored process [2025-04-26 16:22:27,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:27,809 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,809 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:27,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:27,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,809 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:27,810 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:22:27,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:27,813 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (401)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:27,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,821 INFO L229 MonitoredProcess]: Starting monitored process 402 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:27,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (402)] Waiting until timeout for monitored process [2025-04-26 16:22:27,823 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:27,833 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,833 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:27,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,834 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:27,834 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:27,849 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2025-04-26 16:22:27,849 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2025-04-26 16:22:27,896 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (402)] Ended with exit code 0 [2025-04-26 16:22:27,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,904 INFO L229 MonitoredProcess]: Starting monitored process 403 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:27,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (403)] Waiting until timeout for monitored process [2025-04-26 16:22:27,906 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:27,915 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,916 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:27,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,916 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:27,917 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:27,917 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:27,924 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (403)] Ended with exit code 0 [2025-04-26 16:22:27,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,931 INFO L229 MonitoredProcess]: Starting monitored process 404 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:27,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (404)] Waiting until timeout for monitored process [2025-04-26 16:22:27,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:22:27,942 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,942 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:27,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,942 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:27,944 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:27,944 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:27,952 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (404)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:27,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,959 INFO L229 MonitoredProcess]: Starting monitored process 405 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:27,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (405)] Waiting until timeout for monitored process [2025-04-26 16:22:27,961 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:27,971 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,971 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:27,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,971 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:27,973 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:27,973 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:27,979 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (405)] Ended with exit code 0 [2025-04-26 16:22:27,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,987 INFO L229 MonitoredProcess]: Starting monitored process 406 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:27,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (406)] Waiting until timeout for monitored process [2025-04-26 16:22:27,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:22:27,998 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:27,999 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:27,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:27,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,999 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:27,999 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:22:27,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:28,002 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:28,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (406)] Ended with exit code 0 [2025-04-26 16:22:28,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:28,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:28,008 INFO L229 MonitoredProcess]: Starting monitored process 407 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:28,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (407)] Waiting until timeout for monitored process [2025-04-26 16:22:28,010 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:28,019 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:28,019 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:28,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:28,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:28,020 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:28,021 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:28,021 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:28,028 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:28,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (407)] Ended with exit code 0 [2025-04-26 16:22:28,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:28,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:28,034 INFO L229 MonitoredProcess]: Starting monitored process 408 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:28,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (408)] Waiting until timeout for monitored process [2025-04-26 16:22:28,035 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:28,045 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:28,045 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:28,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:28,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:28,045 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:28,047 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:28,047 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:28,053 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:28,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (408)] Ended with exit code 0 [2025-04-26 16:22:28,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:28,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:28,059 INFO L229 MonitoredProcess]: Starting monitored process 409 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:28,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (409)] Waiting until timeout for monitored process [2025-04-26 16:22:28,060 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:28,070 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:28,070 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:28,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:28,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:28,070 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:28,071 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:28,071 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:28,077 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:28,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (409)] Ended with exit code 0 [2025-04-26 16:22:28,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:28,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:28,083 INFO L229 MonitoredProcess]: Starting monitored process 410 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:28,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (410)] Waiting until timeout for monitored process [2025-04-26 16:22:28,085 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:28,094 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:28,095 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:28,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:28,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:28,095 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:28,096 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:28,096 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:28,102 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:28,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (410)] Ended with exit code 0 [2025-04-26 16:22:28,107 INFO L453 LassoAnalysis]: Using template '2-lex'. [2025-04-26 16:22:28,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:28,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:28,109 INFO L229 MonitoredProcess]: Starting monitored process 411 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:28,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (411)] Waiting until timeout for monitored process [2025-04-26 16:22:28,111 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:28,120 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:28,120 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:28,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:28,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:28,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:28,120 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:28,121 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:22:28,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:28,122 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:28,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (411)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:28,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:28,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:28,129 INFO L229 MonitoredProcess]: Starting monitored process 412 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:28,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (412)] Waiting until timeout for monitored process [2025-04-26 16:22:28,130 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:28,139 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:28,140 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:28,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:28,140 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:28,140 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:28,151 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2025-04-26 16:22:28,151 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:22:28,217 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:28,275 INFO L436 ModelExtractionUtils]: Simplification made 25 calls to the SMT solver. [2025-04-26 16:22:28,275 INFO L437 ModelExtractionUtils]: 24 out of 52 variables were initially zero. Simplification set additionally 20 variables to zero. [2025-04-26 16:22:28,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:28,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:28,277 INFO L229 MonitoredProcess]: Starting monitored process 413 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:28,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (413)] Waiting until timeout for monitored process [2025-04-26 16:22:28,278 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:28,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (413)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:28,296 INFO L439 nArgumentSynthesizer]: Removed 7 redundant supporting invariants from a total of 8. [2025-04-26 16:22:28,296 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:28,296 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function 2-lexicographic ranking function: f(cnt, N, workerWithAssertThread1of1ForFork0_i#1) = Supporting invariants [-1*cnt + 1*N >= 0] [2025-04-26 16:22:28,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (412)] Ended with exit code 0 [2025-04-26 16:22:28,306 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:28,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:28,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:28,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:28,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:28,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:28,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:28,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:28,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:28,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:28,332 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:28,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:28,441 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:28,441 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 16:22:28,441 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1375 states and 3635 transitions. cyclomatic complexity: 2315 Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (in total 25), 7 states have internal predecessors, (25), 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:28,542 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1375 states and 3635 transitions. cyclomatic complexity: 2315. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (in total 25), 7 states have internal predecessors, (25), 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 1546 states and 4009 transitions. Complement of second has 13 states. [2025-04-26 16:22:28,543 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (in total 25), 7 states have internal predecessors, (25), 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:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2025-04-26 16:22:28,543 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 17 letters. Loop has 8 letters. [2025-04-26 16:22:28,543 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:28,543 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 25 letters. Loop has 8 letters. [2025-04-26 16:22:28,543 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:28,543 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 17 letters. Loop has 16 letters. [2025-04-26 16:22:28,543 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:28,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1546 states and 4009 transitions. [2025-04-26 16:22:28,548 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 224 [2025-04-26 16:22:28,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1546 states to 1444 states and 3763 transitions. [2025-04-26 16:22:28,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 957 [2025-04-26 16:22:28,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 974 [2025-04-26 16:22:28,551 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1444 states and 3763 transitions. [2025-04-26 16:22:28,551 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:28,551 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1444 states and 3763 transitions. [2025-04-26 16:22:28,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states and 3763 transitions. [2025-04-26 16:22:28,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1375. [2025-04-26 16:22:28,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1375 states have (on average 2.634909090909091) internal successors, (in total 3623), 1374 states have internal predecessors, (3623), 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:28,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 3623 transitions. [2025-04-26 16:22:28,562 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1375 states and 3623 transitions. [2025-04-26 16:22:28,562 INFO L438 stractBuchiCegarLoop]: Abstraction has 1375 states and 3623 transitions. [2025-04-26 16:22:28,562 INFO L340 stractBuchiCegarLoop]: ======== Iteration 38 ============ [2025-04-26 16:22:28,562 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1375 states and 3623 transitions. [2025-04-26 16:22:28,565 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:28,565 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:28,565 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:28,565 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:28,565 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:28,565 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[107] L41-->L42: Formula: (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:28,565 INFO L754 eck$LassoCheckResult]: Loop: "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" [2025-04-26 16:22:28,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:28,565 INFO L85 PathProgramCache]: Analyzing trace with hash -521314273, now seen corresponding path program 10 times [2025-04-26 16:22:28,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:28,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299118346] [2025-04-26 16:22:28,566 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:28,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:28,567 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-26 16:22:28,568 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:28,568 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:28,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,568 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:28,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:28,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:28,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:28,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:28,570 INFO L85 PathProgramCache]: Analyzing trace with hash 57660507, now seen corresponding path program 18 times [2025-04-26 16:22:28,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:28,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092315175] [2025-04-26 16:22:28,570 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:28,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:28,571 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:28,571 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:28,571 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:28,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,571 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:28,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:28,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:28,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:28,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:28,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1325255047, now seen corresponding path program 13 times [2025-04-26 16:22:28,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:28,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442763916] [2025-04-26 16:22:28,572 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:28,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:28,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:28,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:28,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:28,698 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:28,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:28,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442763916] [2025-04-26 16:22:28,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442763916] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:28,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:28,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:28,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454296720] [2025-04-26 16:22:28,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:28,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:28,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:28,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:28,727 INFO L87 Difference]: Start difference. First operand 1375 states and 3623 transitions. cyclomatic complexity: 2303 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:28,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:28,946 INFO L93 Difference]: Finished difference Result 2080 states and 5297 transitions. [2025-04-26 16:22:28,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2080 states and 5297 transitions. [2025-04-26 16:22:28,952 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 224 [2025-04-26 16:22:28,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2080 states to 2052 states and 5241 transitions. [2025-04-26 16:22:28,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1190 [2025-04-26 16:22:28,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1190 [2025-04-26 16:22:28,957 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2052 states and 5241 transitions. [2025-04-26 16:22:28,957 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:28,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2052 states and 5241 transitions. [2025-04-26 16:22:28,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states and 5241 transitions. [2025-04-26 16:22:28,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 1350. [2025-04-26 16:22:28,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1350 states have (on average 2.627407407407407) internal successors, (in total 3547), 1349 states have internal predecessors, (3547), 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:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 3547 transitions. [2025-04-26 16:22:28,969 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1350 states and 3547 transitions. [2025-04-26 16:22:28,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-26 16:22:28,970 INFO L438 stractBuchiCegarLoop]: Abstraction has 1350 states and 3547 transitions. [2025-04-26 16:22:28,970 INFO L340 stractBuchiCegarLoop]: ======== Iteration 39 ============ [2025-04-26 16:22:28,970 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1350 states and 3547 transitions. [2025-04-26 16:22:28,973 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:28,973 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:28,973 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:28,973 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:28,973 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:28,973 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:28,973 INFO L754 eck$LassoCheckResult]: Loop: "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:22:28,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2063403156, now seen corresponding path program 10 times [2025-04-26 16:22:28,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:28,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575164877] [2025-04-26 16:22:28,973 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:28,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:28,975 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-26 16:22:28,976 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:28,976 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:28,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,976 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:28,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:28,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:28,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:28,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:28,977 INFO L85 PathProgramCache]: Analyzing trace with hash -53527749, now seen corresponding path program 21 times [2025-04-26 16:22:28,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:28,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962515643] [2025-04-26 16:22:28,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:28,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:28,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:28,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:28,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:28,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,979 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:28,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:28,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:28,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:28,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:28,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1602590630, now seen corresponding path program 17 times [2025-04-26 16:22:28,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:28,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168452464] [2025-04-26 16:22:28,981 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:28,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:28,982 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:28,983 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:28,983 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:28,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:29,108 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:29,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:29,109 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168452464] [2025-04-26 16:22:29,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168452464] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:29,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:29,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:29,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033702763] [2025-04-26 16:22:29,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:29,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:29,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:29,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:29,148 INFO L87 Difference]: Start difference. First operand 1350 states and 3547 transitions. cyclomatic complexity: 2252 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:29,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:29,385 INFO L93 Difference]: Finished difference Result 1889 states and 4846 transitions. [2025-04-26 16:22:29,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1889 states and 4846 transitions. [2025-04-26 16:22:29,394 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:29,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1889 states to 1861 states and 4790 transitions. [2025-04-26 16:22:29,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1170 [2025-04-26 16:22:29,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1170 [2025-04-26 16:22:29,400 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1861 states and 4790 transitions. [2025-04-26 16:22:29,400 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:29,400 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1861 states and 4790 transitions. [2025-04-26 16:22:29,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states and 4790 transitions. [2025-04-26 16:22:29,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1391. [2025-04-26 16:22:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1391 states have (on average 2.6347951114306256) internal successors, (in total 3665), 1390 states have internal predecessors, (3665), 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:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 3665 transitions. [2025-04-26 16:22:29,418 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1391 states and 3665 transitions. [2025-04-26 16:22:29,418 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:29,419 INFO L438 stractBuchiCegarLoop]: Abstraction has 1391 states and 3665 transitions. [2025-04-26 16:22:29,419 INFO L340 stractBuchiCegarLoop]: ======== Iteration 40 ============ [2025-04-26 16:22:29,419 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1391 states and 3665 transitions. [2025-04-26 16:22:29,423 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:29,423 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:29,423 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:29,423 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:29,423 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:29,423 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[107] L41-->L42: Formula: (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:29,424 INFO L754 eck$LassoCheckResult]: Loop: "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" [2025-04-26 16:22:29,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:29,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1818951519, now seen corresponding path program 11 times [2025-04-26 16:22:29,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:29,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966987782] [2025-04-26 16:22:29,424 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:29,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:29,426 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:29,427 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:29,427 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:29,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:29,427 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:29,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:29,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:29,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:29,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:29,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:29,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:29,429 INFO L85 PathProgramCache]: Analyzing trace with hash 57660507, now seen corresponding path program 19 times [2025-04-26 16:22:29,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:29,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25374877] [2025-04-26 16:22:29,429 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:29,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:29,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:29,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:29,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:29,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:29,432 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:29,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:29,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:29,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:29,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:29,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:29,433 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:29,433 INFO L85 PathProgramCache]: Analyzing trace with hash -590727941, now seen corresponding path program 14 times [2025-04-26 16:22:29,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:29,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858797829] [2025-04-26 16:22:29,433 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:29,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:29,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:29,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:29,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:29,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:29,541 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:29,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:29,541 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858797829] [2025-04-26 16:22:29,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858797829] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:29,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:29,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:29,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357094194] [2025-04-26 16:22:29,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:29,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:29,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:29,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:29,576 INFO L87 Difference]: Start difference. First operand 1391 states and 3665 transitions. cyclomatic complexity: 2329 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:29,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:29,728 INFO L93 Difference]: Finished difference Result 1696 states and 4356 transitions. [2025-04-26 16:22:29,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1696 states and 4356 transitions. [2025-04-26 16:22:29,733 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 224 [2025-04-26 16:22:29,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1696 states to 1668 states and 4300 transitions. [2025-04-26 16:22:29,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1070 [2025-04-26 16:22:29,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1070 [2025-04-26 16:22:29,737 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1668 states and 4300 transitions. [2025-04-26 16:22:29,737 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:29,737 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1668 states and 4300 transitions. [2025-04-26 16:22:29,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states and 4300 transitions. [2025-04-26 16:22:29,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1395. [2025-04-26 16:22:29,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1395 states have (on average 2.6344086021505375) internal successors, (in total 3675), 1394 states have internal predecessors, (3675), 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:29,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 3675 transitions. [2025-04-26 16:22:29,748 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1395 states and 3675 transitions. [2025-04-26 16:22:29,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:29,749 INFO L438 stractBuchiCegarLoop]: Abstraction has 1395 states and 3675 transitions. [2025-04-26 16:22:29,749 INFO L340 stractBuchiCegarLoop]: ======== Iteration 41 ============ [2025-04-26 16:22:29,749 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1395 states and 3675 transitions. [2025-04-26 16:22:29,752 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:29,752 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:29,752 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:29,752 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:29,752 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:29,753 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:29,753 INFO L754 eck$LassoCheckResult]: Loop: "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:22:29,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:29,753 INFO L85 PathProgramCache]: Analyzing trace with hash 96934848, now seen corresponding path program 11 times [2025-04-26 16:22:29,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:29,753 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643701134] [2025-04-26 16:22:29,753 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:29,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:29,754 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:29,755 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:29,755 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:29,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:29,755 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:29,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:29,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:29,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:29,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:29,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:29,758 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:29,758 INFO L85 PathProgramCache]: Analyzing trace with hash -53527749, now seen corresponding path program 22 times [2025-04-26 16:22:29,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:29,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33744389] [2025-04-26 16:22:29,758 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:29,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:29,759 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:22:29,760 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:29,760 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:29,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:29,760 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:29,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:29,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:29,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:29,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:29,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:29,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:29,761 INFO L85 PathProgramCache]: Analyzing trace with hash 576333818, now seen corresponding path program 18 times [2025-04-26 16:22:29,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:29,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120022702] [2025-04-26 16:22:29,761 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:29,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:29,763 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:29,763 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:29,764 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:29,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:29,863 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:29,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:29,863 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120022702] [2025-04-26 16:22:29,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120022702] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:29,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:29,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:29,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123768209] [2025-04-26 16:22:29,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:29,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:29,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:29,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:29,893 INFO L87 Difference]: Start difference. First operand 1395 states and 3675 transitions. cyclomatic complexity: 2335 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:30,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:30,100 INFO L93 Difference]: Finished difference Result 1942 states and 4958 transitions. [2025-04-26 16:22:30,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1942 states and 4958 transitions. [2025-04-26 16:22:30,107 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:30,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1942 states to 1914 states and 4902 transitions. [2025-04-26 16:22:30,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1179 [2025-04-26 16:22:30,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1179 [2025-04-26 16:22:30,111 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1914 states and 4902 transitions. [2025-04-26 16:22:30,112 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:30,112 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1914 states and 4902 transitions. [2025-04-26 16:22:30,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states and 4902 transitions. [2025-04-26 16:22:30,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1395. [2025-04-26 16:22:30,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1395 states have (on average 2.6344086021505375) internal successors, (in total 3675), 1394 states have internal predecessors, (3675), 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:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 3675 transitions. [2025-04-26 16:22:30,125 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1395 states and 3675 transitions. [2025-04-26 16:22:30,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-26 16:22:30,126 INFO L438 stractBuchiCegarLoop]: Abstraction has 1395 states and 3675 transitions. [2025-04-26 16:22:30,126 INFO L340 stractBuchiCegarLoop]: ======== Iteration 42 ============ [2025-04-26 16:22:30,126 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1395 states and 3675 transitions. [2025-04-26 16:22:30,135 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:30,135 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:30,135 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:30,135 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:30,135 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:30,136 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:30,136 INFO L754 eck$LassoCheckResult]: Loop: "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:22:30,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:30,136 INFO L85 PathProgramCache]: Analyzing trace with hash -169196628, now seen corresponding path program 12 times [2025-04-26 16:22:30,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:30,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122527588] [2025-04-26 16:22:30,136 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:30,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:30,138 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:30,138 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:30,138 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:30,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:30,139 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:30,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:30,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:30,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:30,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:30,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:30,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:30,140 INFO L85 PathProgramCache]: Analyzing trace with hash -53527749, now seen corresponding path program 23 times [2025-04-26 16:22:30,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:30,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900467072] [2025-04-26 16:22:30,141 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:30,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:30,143 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:30,144 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:30,144 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:30,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:30,144 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:30,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:30,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:30,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:30,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:30,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:30,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:30,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1534895078, now seen corresponding path program 19 times [2025-04-26 16:22:30,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:30,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55170034] [2025-04-26 16:22:30,146 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:30,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:30,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:30,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:30,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:30,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:30,257 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:30,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:30,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55170034] [2025-04-26 16:22:30,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55170034] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:30,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:30,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:30,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696989390] [2025-04-26 16:22:30,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:30,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:30,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:30,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:30,287 INFO L87 Difference]: Start difference. First operand 1395 states and 3675 transitions. cyclomatic complexity: 2335 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:30,492 INFO L93 Difference]: Finished difference Result 1985 states and 5082 transitions. [2025-04-26 16:22:30,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1985 states and 5082 transitions. [2025-04-26 16:22:30,499 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:30,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1985 states to 1957 states and 5026 transitions. [2025-04-26 16:22:30,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1218 [2025-04-26 16:22:30,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1218 [2025-04-26 16:22:30,504 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1957 states and 5026 transitions. [2025-04-26 16:22:30,504 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:30,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1957 states and 5026 transitions. [2025-04-26 16:22:30,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states and 5026 transitions. [2025-04-26 16:22:30,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1395. [2025-04-26 16:22:30,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1395 states have (on average 2.6344086021505375) internal successors, (in total 3675), 1394 states have internal predecessors, (3675), 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:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 3675 transitions. [2025-04-26 16:22:30,517 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1395 states and 3675 transitions. [2025-04-26 16:22:30,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:30,518 INFO L438 stractBuchiCegarLoop]: Abstraction has 1395 states and 3675 transitions. [2025-04-26 16:22:30,518 INFO L340 stractBuchiCegarLoop]: ======== Iteration 43 ============ [2025-04-26 16:22:30,518 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1395 states and 3675 transitions. [2025-04-26 16:22:30,521 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:30,521 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:30,521 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:30,521 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:30,521 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:30,521 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[107] L41-->L42: Formula: (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:30,521 INFO L754 eck$LassoCheckResult]: Loop: "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" [2025-04-26 16:22:30,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:30,521 INFO L85 PathProgramCache]: Analyzing trace with hash -290513759, now seen corresponding path program 12 times [2025-04-26 16:22:30,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:30,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091657808] [2025-04-26 16:22:30,521 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:30,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:30,523 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:30,523 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:30,523 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:30,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:30,523 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:30,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:30,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:30,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:30,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:30,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:30,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:30,525 INFO L85 PathProgramCache]: Analyzing trace with hash 57660507, now seen corresponding path program 20 times [2025-04-26 16:22:30,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:30,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549416056] [2025-04-26 16:22:30,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:30,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:30,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:30,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:30,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:30,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:30,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:30,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:30,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:30,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:30,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:30,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:30,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:30,528 INFO L85 PathProgramCache]: Analyzing trace with hash -100118277, now seen corresponding path program 15 times [2025-04-26 16:22:30,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:30,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292979459] [2025-04-26 16:22:30,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:30,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:30,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:30,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:30,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:30,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:30,637 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:30,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:30,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292979459] [2025-04-26 16:22:30,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292979459] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:30,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:30,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:30,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287454183] [2025-04-26 16:22:30,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:30,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:30,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:30,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:30,669 INFO L87 Difference]: Start difference. First operand 1395 states and 3675 transitions. cyclomatic complexity: 2335 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:30,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:30,917 INFO L93 Difference]: Finished difference Result 2356 states and 5957 transitions. [2025-04-26 16:22:30,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2356 states and 5957 transitions. [2025-04-26 16:22:30,924 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 224 [2025-04-26 16:22:30,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2356 states to 2328 states and 5901 transitions. [2025-04-26 16:22:30,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1281 [2025-04-26 16:22:30,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1281 [2025-04-26 16:22:30,930 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2328 states and 5901 transitions. [2025-04-26 16:22:30,930 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:30,930 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2328 states and 5901 transitions. [2025-04-26 16:22:30,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states and 5901 transitions. [2025-04-26 16:22:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 1396. [2025-04-26 16:22:30,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1396 states have (on average 2.633954154727794) internal successors, (in total 3677), 1395 states have internal predecessors, (3677), 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:30,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 3677 transitions. [2025-04-26 16:22:30,945 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1396 states and 3677 transitions. [2025-04-26 16:22:30,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-26 16:22:30,945 INFO L438 stractBuchiCegarLoop]: Abstraction has 1396 states and 3677 transitions. [2025-04-26 16:22:30,945 INFO L340 stractBuchiCegarLoop]: ======== Iteration 44 ============ [2025-04-26 16:22:30,945 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1396 states and 3677 transitions. [2025-04-26 16:22:30,948 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:30,949 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:30,949 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:30,949 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:30,949 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:30,949 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:30,949 INFO L754 eck$LassoCheckResult]: Loop: "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:22:30,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:30,949 INFO L85 PathProgramCache]: Analyzing trace with hash 96725598, now seen corresponding path program 13 times [2025-04-26 16:22:30,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:30,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300562693] [2025-04-26 16:22:30,950 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:30,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:30,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:30,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:30,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:30,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:30,951 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:30,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:30,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:30,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:30,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:30,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:30,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:30,953 INFO L85 PathProgramCache]: Analyzing trace with hash -53527749, now seen corresponding path program 24 times [2025-04-26 16:22:30,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:30,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48345684] [2025-04-26 16:22:30,953 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:30,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:30,957 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:30,957 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:30,958 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:30,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:30,958 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:30,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:30,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:30,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:30,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:30,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:30,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:30,959 INFO L85 PathProgramCache]: Analyzing trace with hash -102401896, now seen corresponding path program 20 times [2025-04-26 16:22:30,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:30,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769669149] [2025-04-26 16:22:30,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:30,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:30,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:30,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:30,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:30,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:31,063 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:31,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:31,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769669149] [2025-04-26 16:22:31,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769669149] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:31,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:31,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:31,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401602759] [2025-04-26 16:22:31,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:31,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:31,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:31,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:31,093 INFO L87 Difference]: Start difference. First operand 1396 states and 3677 transitions. cyclomatic complexity: 2336 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:31,310 INFO L93 Difference]: Finished difference Result 2048 states and 5224 transitions. [2025-04-26 16:22:31,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2048 states and 5224 transitions. [2025-04-26 16:22:31,316 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:31,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2048 states to 2020 states and 5168 transitions. [2025-04-26 16:22:31,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1240 [2025-04-26 16:22:31,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1240 [2025-04-26 16:22:31,321 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2020 states and 5168 transitions. [2025-04-26 16:22:31,321 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:31,321 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2020 states and 5168 transitions. [2025-04-26 16:22:31,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states and 5168 transitions. [2025-04-26 16:22:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1389. [2025-04-26 16:22:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1389 states have (on average 2.6313894888408926) internal successors, (in total 3655), 1388 states have internal predecessors, (3655), 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:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 3655 transitions. [2025-04-26 16:22:31,334 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1389 states and 3655 transitions. [2025-04-26 16:22:31,335 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:31,335 INFO L438 stractBuchiCegarLoop]: Abstraction has 1389 states and 3655 transitions. [2025-04-26 16:22:31,335 INFO L340 stractBuchiCegarLoop]: ======== Iteration 45 ============ [2025-04-26 16:22:31,335 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1389 states and 3655 transitions. [2025-04-26 16:22:31,338 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:31,338 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:31,338 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:31,338 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:31,338 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:31,339 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[107] L41-->L42: Formula: (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:31,339 INFO L754 eck$LassoCheckResult]: Loop: "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" [2025-04-26 16:22:31,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:31,339 INFO L85 PathProgramCache]: Analyzing trace with hash -290052479, now seen corresponding path program 13 times [2025-04-26 16:22:31,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:31,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234241542] [2025-04-26 16:22:31,339 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:31,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:31,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:31,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:31,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:31,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,341 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:31,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:31,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:31,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:31,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:31,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:31,343 INFO L85 PathProgramCache]: Analyzing trace with hash 57660507, now seen corresponding path program 21 times [2025-04-26 16:22:31,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:31,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767309483] [2025-04-26 16:22:31,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:31,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:31,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:31,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:31,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:31,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,344 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:31,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:31,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:31,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:31,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:31,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:31,346 INFO L85 PathProgramCache]: Analyzing trace with hash 651655899, now seen corresponding path program 16 times [2025-04-26 16:22:31,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:31,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765124363] [2025-04-26 16:22:31,346 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:31,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:31,347 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-26 16:22:31,348 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:31,348 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-26 16:22:31,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:31,469 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:31,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:31,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765124363] [2025-04-26 16:22:31,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765124363] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:31,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:31,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:31,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275506597] [2025-04-26 16:22:31,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:31,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:31,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:31,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:31,500 INFO L87 Difference]: Start difference. First operand 1389 states and 3655 transitions. cyclomatic complexity: 2321 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:31,768 INFO L93 Difference]: Finished difference Result 2111 states and 5374 transitions. [2025-04-26 16:22:31,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2111 states and 5374 transitions. [2025-04-26 16:22:31,775 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 224 [2025-04-26 16:22:31,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2111 states to 2083 states and 5318 transitions. [2025-04-26 16:22:31,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1200 [2025-04-26 16:22:31,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1200 [2025-04-26 16:22:31,780 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2083 states and 5318 transitions. [2025-04-26 16:22:31,780 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:31,780 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2083 states and 5318 transitions. [2025-04-26 16:22:31,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states and 5318 transitions. [2025-04-26 16:22:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1387. [2025-04-26 16:22:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1387 states, 1387 states have (on average 2.6315789473684212) internal successors, (in total 3650), 1386 states have internal predecessors, (3650), 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:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 3650 transitions. [2025-04-26 16:22:31,794 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1387 states and 3650 transitions. [2025-04-26 16:22:31,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:31,794 INFO L438 stractBuchiCegarLoop]: Abstraction has 1387 states and 3650 transitions. [2025-04-26 16:22:31,794 INFO L340 stractBuchiCegarLoop]: ======== Iteration 46 ============ [2025-04-26 16:22:31,794 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1387 states and 3650 transitions. [2025-04-26 16:22:31,797 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:31,797 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:31,797 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:31,797 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:31,797 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:31,798 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[107] L41-->L42: Formula: (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:31,798 INFO L754 eck$LassoCheckResult]: Loop: "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" [2025-04-26 16:22:31,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:31,798 INFO L85 PathProgramCache]: Analyzing trace with hash -647228255, now seen corresponding path program 14 times [2025-04-26 16:22:31,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:31,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704494007] [2025-04-26 16:22:31,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:31,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:31,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:31,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:31,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:31,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,800 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:31,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:31,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:31,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:31,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:31,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:31,802 INFO L85 PathProgramCache]: Analyzing trace with hash 57660507, now seen corresponding path program 22 times [2025-04-26 16:22:31,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:31,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817131470] [2025-04-26 16:22:31,802 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:31,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:31,804 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:22:31,804 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:31,804 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:31,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,804 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:31,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:31,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:31,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:31,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:31,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:31,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1270003461, now seen corresponding path program 17 times [2025-04-26 16:22:31,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:31,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578718155] [2025-04-26 16:22:31,808 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:31,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:31,809 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:31,810 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:31,810 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:31,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:31,916 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:31,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:31,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578718155] [2025-04-26 16:22:31,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578718155] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:31,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:31,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:31,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259232308] [2025-04-26 16:22:31,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:31,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:31,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:31,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:31,945 INFO L87 Difference]: Start difference. First operand 1387 states and 3650 transitions. cyclomatic complexity: 2318 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:32,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:32,154 INFO L93 Difference]: Finished difference Result 1814 states and 4632 transitions. [2025-04-26 16:22:32,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1814 states and 4632 transitions. [2025-04-26 16:22:32,160 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 224 [2025-04-26 16:22:32,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1814 states to 1786 states and 4576 transitions. [2025-04-26 16:22:32,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1140 [2025-04-26 16:22:32,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1140 [2025-04-26 16:22:32,164 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1786 states and 4576 transitions. [2025-04-26 16:22:32,164 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:32,164 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1786 states and 4576 transitions. [2025-04-26 16:22:32,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states and 4576 transitions. [2025-04-26 16:22:32,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1384. [2025-04-26 16:22:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1384 states have (on average 2.628612716763006) internal successors, (in total 3638), 1383 states have internal predecessors, (3638), 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:32,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 3638 transitions. [2025-04-26 16:22:32,188 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1384 states and 3638 transitions. [2025-04-26 16:22:32,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-26 16:22:32,189 INFO L438 stractBuchiCegarLoop]: Abstraction has 1384 states and 3638 transitions. [2025-04-26 16:22:32,189 INFO L340 stractBuchiCegarLoop]: ======== Iteration 47 ============ [2025-04-26 16:22:32,189 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1384 states and 3638 transitions. [2025-04-26 16:22:32,191 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:32,192 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:32,192 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:32,192 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:32,192 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:32,192 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:32,192 INFO L754 eck$LassoCheckResult]: Loop: "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:22:32,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:32,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1737208362, now seen corresponding path program 14 times [2025-04-26 16:22:32,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:32,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945879539] [2025-04-26 16:22:32,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:32,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:32,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:32,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:32,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:32,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:32,194 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:32,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:32,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:32,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:32,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:32,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:32,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:32,196 INFO L85 PathProgramCache]: Analyzing trace with hash -53527749, now seen corresponding path program 25 times [2025-04-26 16:22:32,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:32,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953330495] [2025-04-26 16:22:32,196 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:32,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:32,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:32,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:32,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:32,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:32,198 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:32,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:32,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:32,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:32,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:32,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:32,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:32,199 INFO L85 PathProgramCache]: Analyzing trace with hash -745085936, now seen corresponding path program 21 times [2025-04-26 16:22:32,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:32,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958501380] [2025-04-26 16:22:32,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:32,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:32,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:32,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:32,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:32,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:32,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:32,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:32,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958501380] [2025-04-26 16:22:32,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958501380] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:32,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:32,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:32,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935532431] [2025-04-26 16:22:32,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:32,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:32,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:32,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:32,321 INFO L87 Difference]: Start difference. First operand 1384 states and 3638 transitions. cyclomatic complexity: 2309 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:32,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:32,471 INFO L93 Difference]: Finished difference Result 1744 states and 4465 transitions. [2025-04-26 16:22:32,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1744 states and 4465 transitions. [2025-04-26 16:22:32,476 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:32,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1744 states to 1716 states and 4409 transitions. [2025-04-26 16:22:32,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1056 [2025-04-26 16:22:32,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1056 [2025-04-26 16:22:32,480 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1716 states and 4409 transitions. [2025-04-26 16:22:32,480 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:32,480 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1716 states and 4409 transitions. [2025-04-26 16:22:32,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states and 4409 transitions. [2025-04-26 16:22:32,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1390. [2025-04-26 16:22:32,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1390 states have (on average 2.627338129496403) internal successors, (in total 3652), 1389 states have internal predecessors, (3652), 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:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 3652 transitions. [2025-04-26 16:22:32,492 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1390 states and 3652 transitions. [2025-04-26 16:22:32,492 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:32,492 INFO L438 stractBuchiCegarLoop]: Abstraction has 1390 states and 3652 transitions. [2025-04-26 16:22:32,492 INFO L340 stractBuchiCegarLoop]: ======== Iteration 48 ============ [2025-04-26 16:22:32,492 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1390 states and 3652 transitions. [2025-04-26 16:22:32,495 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:32,495 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:32,495 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:32,495 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:32,495 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:32,496 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[107] L41-->L42: Formula: (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:32,496 INFO L754 eck$LassoCheckResult]: Loop: "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" [2025-04-26 16:22:32,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:32,496 INFO L85 PathProgramCache]: Analyzing trace with hash -631573565, now seen corresponding path program 15 times [2025-04-26 16:22:32,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:32,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707972381] [2025-04-26 16:22:32,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:32,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:32,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:32,498 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:32,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:32,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:32,498 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:32,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:32,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:32,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:32,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:32,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:32,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:32,500 INFO L85 PathProgramCache]: Analyzing trace with hash 57660507, now seen corresponding path program 23 times [2025-04-26 16:22:32,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:32,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271462645] [2025-04-26 16:22:32,500 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:32,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:32,501 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:32,501 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:32,501 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:32,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:32,501 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:32,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:32,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:32,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:32,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:32,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:32,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:32,503 INFO L85 PathProgramCache]: Analyzing trace with hash 889447965, now seen corresponding path program 18 times [2025-04-26 16:22:32,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:32,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493074135] [2025-04-26 16:22:32,503 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:32,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:32,506 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:32,507 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:32,507 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:32,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:32,621 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:32,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:32,622 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493074135] [2025-04-26 16:22:32,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493074135] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:32,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:32,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:32,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645952687] [2025-04-26 16:22:32,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:32,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:32,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:32,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:32,651 INFO L87 Difference]: Start difference. First operand 1390 states and 3652 transitions. cyclomatic complexity: 2317 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:32,834 INFO L93 Difference]: Finished difference Result 1647 states and 4233 transitions. [2025-04-26 16:22:32,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1647 states and 4233 transitions. [2025-04-26 16:22:32,839 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 224 [2025-04-26 16:22:32,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1647 states to 1619 states and 4177 transitions. [2025-04-26 16:22:32,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1045 [2025-04-26 16:22:32,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1045 [2025-04-26 16:22:32,843 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1619 states and 4177 transitions. [2025-04-26 16:22:32,843 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:32,843 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1619 states and 4177 transitions. [2025-04-26 16:22:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states and 4177 transitions. [2025-04-26 16:22:32,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1386. [2025-04-26 16:22:32,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1386 states have (on average 2.6277056277056277) internal successors, (in total 3642), 1385 states have internal predecessors, (3642), 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:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 3642 transitions. [2025-04-26 16:22:32,856 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1386 states and 3642 transitions. [2025-04-26 16:22:32,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:32,856 INFO L438 stractBuchiCegarLoop]: Abstraction has 1386 states and 3642 transitions. [2025-04-26 16:22:32,856 INFO L340 stractBuchiCegarLoop]: ======== Iteration 49 ============ [2025-04-26 16:22:32,856 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1386 states and 3642 transitions. [2025-04-26 16:22:32,859 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:32,859 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:32,859 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:32,859 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:32,859 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:32,859 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[107] L41-->L42: Formula: (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:32,859 INFO L754 eck$LassoCheckResult]: Loop: "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" [2025-04-26 16:22:32,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:32,860 INFO L85 PathProgramCache]: Analyzing trace with hash -303919709, now seen corresponding path program 16 times [2025-04-26 16:22:32,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:32,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706218982] [2025-04-26 16:22:32,860 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:32,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:32,861 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-26 16:22:32,862 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:32,862 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:32,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:32,862 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:32,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:32,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:32,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:32,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:32,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:32,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:32,864 INFO L85 PathProgramCache]: Analyzing trace with hash 57660507, now seen corresponding path program 24 times [2025-04-26 16:22:32,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:32,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044838057] [2025-04-26 16:22:32,864 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:32,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:32,865 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:32,865 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:32,865 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:32,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:32,865 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:32,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:32,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:32,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:32,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:32,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:32,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:32,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1942200317, now seen corresponding path program 19 times [2025-04-26 16:22:32,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:32,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996333369] [2025-04-26 16:22:32,866 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:32,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:32,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:32,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:32,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:32,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:32,961 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:32,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:32,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996333369] [2025-04-26 16:22:32,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996333369] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:32,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:32,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:32,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242115245] [2025-04-26 16:22:32,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:32,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:32,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:32,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:32,990 INFO L87 Difference]: Start difference. First operand 1386 states and 3642 transitions. cyclomatic complexity: 2311 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:33,212 INFO L93 Difference]: Finished difference Result 1981 states and 5050 transitions. [2025-04-26 16:22:33,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1981 states and 5050 transitions. [2025-04-26 16:22:33,219 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 224 [2025-04-26 16:22:33,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1981 states to 1953 states and 4994 transitions. [2025-04-26 16:22:33,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1128 [2025-04-26 16:22:33,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1128 [2025-04-26 16:22:33,223 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1953 states and 4994 transitions. [2025-04-26 16:22:33,223 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:33,223 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1953 states and 4994 transitions. [2025-04-26 16:22:33,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states and 4994 transitions. [2025-04-26 16:22:33,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1352. [2025-04-26 16:22:33,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1352 states have (on average 2.6183431952662723) internal successors, (in total 3540), 1351 states have internal predecessors, (3540), 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:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 3540 transitions. [2025-04-26 16:22:33,236 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1352 states and 3540 transitions. [2025-04-26 16:22:33,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:33,237 INFO L438 stractBuchiCegarLoop]: Abstraction has 1352 states and 3540 transitions. [2025-04-26 16:22:33,237 INFO L340 stractBuchiCegarLoop]: ======== Iteration 50 ============ [2025-04-26 16:22:33,237 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1352 states and 3540 transitions. [2025-04-26 16:22:33,239 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:33,239 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:33,239 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:33,240 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:33,240 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:33,240 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:33,240 INFO L754 eck$LassoCheckResult]: Loop: "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:22:33,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:33,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1811752240, now seen corresponding path program 15 times [2025-04-26 16:22:33,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:33,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387082081] [2025-04-26 16:22:33,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:33,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:33,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:33,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:33,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:33,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:33,242 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:33,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:33,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:33,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:33,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:33,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:33,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:33,244 INFO L85 PathProgramCache]: Analyzing trace with hash -53527749, now seen corresponding path program 26 times [2025-04-26 16:22:33,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:33,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081531224] [2025-04-26 16:22:33,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:33,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:33,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:33,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:33,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:33,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:33,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:33,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:33,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:33,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:33,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:33,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:33,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:33,247 INFO L85 PathProgramCache]: Analyzing trace with hash 946323818, now seen corresponding path program 22 times [2025-04-26 16:22:33,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:33,247 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069089234] [2025-04-26 16:22:33,247 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:33,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:33,248 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-26 16:22:33,249 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:33,249 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-26 16:22:33,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:33,347 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:33,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:33,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069089234] [2025-04-26 16:22:33,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069089234] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:33,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:33,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:33,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820681097] [2025-04-26 16:22:33,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:33,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:33,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:33,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:33,376 INFO L87 Difference]: Start difference. First operand 1352 states and 3540 transitions. cyclomatic complexity: 2243 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:33,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:33,587 INFO L93 Difference]: Finished difference Result 1887 states and 4824 transitions. [2025-04-26 16:22:33,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1887 states and 4824 transitions. [2025-04-26 16:22:33,593 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:33,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1887 states to 1859 states and 4768 transitions. [2025-04-26 16:22:33,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1168 [2025-04-26 16:22:33,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1168 [2025-04-26 16:22:33,598 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1859 states and 4768 transitions. [2025-04-26 16:22:33,598 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:33,598 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1859 states and 4768 transitions. [2025-04-26 16:22:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states and 4768 transitions. [2025-04-26 16:22:33,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1377. [2025-04-26 16:22:33,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1377 states have (on average 2.6238198983297023) internal successors, (in total 3613), 1376 states have internal predecessors, (3613), 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:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 3613 transitions. [2025-04-26 16:22:33,609 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1377 states and 3613 transitions. [2025-04-26 16:22:33,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:33,610 INFO L438 stractBuchiCegarLoop]: Abstraction has 1377 states and 3613 transitions. [2025-04-26 16:22:33,610 INFO L340 stractBuchiCegarLoop]: ======== Iteration 51 ============ [2025-04-26 16:22:33,610 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1377 states and 3613 transitions. [2025-04-26 16:22:33,613 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:33,613 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:33,613 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:33,613 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:33,613 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:33,613 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:33,613 INFO L754 eck$LassoCheckResult]: Loop: "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:22:33,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:33,614 INFO L85 PathProgramCache]: Analyzing trace with hash -589008528, now seen corresponding path program 16 times [2025-04-26 16:22:33,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:33,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328167544] [2025-04-26 16:22:33,614 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:33,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:33,615 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-26 16:22:33,616 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:33,616 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:33,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:33,616 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:33,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:33,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:33,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:33,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:33,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:33,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:33,617 INFO L85 PathProgramCache]: Analyzing trace with hash -53527749, now seen corresponding path program 27 times [2025-04-26 16:22:33,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:33,617 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267060519] [2025-04-26 16:22:33,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:33,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:33,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:33,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:33,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:33,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:33,619 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:33,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:33,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:33,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:33,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:33,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:33,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:33,621 INFO L85 PathProgramCache]: Analyzing trace with hash 878628266, now seen corresponding path program 23 times [2025-04-26 16:22:33,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:33,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305948396] [2025-04-26 16:22:33,621 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:33,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:33,622 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:33,623 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:33,623 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:33,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:33,732 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:33,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:33,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305948396] [2025-04-26 16:22:33,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305948396] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:33,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:33,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:33,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960102538] [2025-04-26 16:22:33,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:33,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:33,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:33,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:33,772 INFO L87 Difference]: Start difference. First operand 1377 states and 3613 transitions. cyclomatic complexity: 2291 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:33,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:33,991 INFO L93 Difference]: Finished difference Result 1978 states and 5048 transitions. [2025-04-26 16:22:33,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1978 states and 5048 transitions. [2025-04-26 16:22:33,998 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:34,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1978 states to 1950 states and 4992 transitions. [2025-04-26 16:22:34,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1211 [2025-04-26 16:22:34,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1211 [2025-04-26 16:22:34,004 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1950 states and 4992 transitions. [2025-04-26 16:22:34,004 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:34,004 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1950 states and 4992 transitions. [2025-04-26 16:22:34,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states and 4992 transitions. [2025-04-26 16:22:34,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1340. [2025-04-26 16:22:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1340 states have (on average 2.6156716417910446) internal successors, (in total 3505), 1339 states have internal predecessors, (3505), 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:34,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 3505 transitions. [2025-04-26 16:22:34,017 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1340 states and 3505 transitions. [2025-04-26 16:22:34,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:34,017 INFO L438 stractBuchiCegarLoop]: Abstraction has 1340 states and 3505 transitions. [2025-04-26 16:22:34,018 INFO L340 stractBuchiCegarLoop]: ======== Iteration 52 ============ [2025-04-26 16:22:34,018 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1340 states and 3505 transitions. [2025-04-26 16:22:34,020 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:34,021 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:34,021 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:34,021 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:34,021 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:34,021 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:34,021 INFO L754 eck$LassoCheckResult]: Loop: "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:22:34,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:34,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1549241040, now seen corresponding path program 17 times [2025-04-26 16:22:34,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:34,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431903235] [2025-04-26 16:22:34,022 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:34,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:34,023 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:34,023 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:34,023 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:34,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,023 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:34,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:34,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:34,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:34,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:34,025 INFO L85 PathProgramCache]: Analyzing trace with hash -53527749, now seen corresponding path program 28 times [2025-04-26 16:22:34,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:34,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590589301] [2025-04-26 16:22:34,025 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:34,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:34,040 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:22:34,041 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:34,041 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:34,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,041 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:34,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:34,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:34,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:34,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:34,043 INFO L85 PathProgramCache]: Analyzing trace with hash -138210966, now seen corresponding path program 24 times [2025-04-26 16:22:34,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:34,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447007078] [2025-04-26 16:22:34,043 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:34,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:34,044 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:34,045 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:34,045 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:34,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:34,152 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:34,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:34,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447007078] [2025-04-26 16:22:34,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447007078] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:34,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:34,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:34,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420528846] [2025-04-26 16:22:34,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:34,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:34,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:34,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:34,183 INFO L87 Difference]: Start difference. First operand 1340 states and 3505 transitions. cyclomatic complexity: 2220 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:34,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:34,426 INFO L93 Difference]: Finished difference Result 1942 states and 4913 transitions. [2025-04-26 16:22:34,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1942 states and 4913 transitions. [2025-04-26 16:22:34,432 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:34,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1942 states to 1914 states and 4857 transitions. [2025-04-26 16:22:34,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1144 [2025-04-26 16:22:34,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1144 [2025-04-26 16:22:34,437 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1914 states and 4857 transitions. [2025-04-26 16:22:34,437 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:34,437 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1914 states and 4857 transitions. [2025-04-26 16:22:34,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states and 4857 transitions. [2025-04-26 16:22:34,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1324. [2025-04-26 16:22:34,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1324 states have (on average 2.617069486404834) internal successors, (in total 3465), 1323 states have internal predecessors, (3465), 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:34,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 3465 transitions. [2025-04-26 16:22:34,450 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1324 states and 3465 transitions. [2025-04-26 16:22:34,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-26 16:22:34,450 INFO L438 stractBuchiCegarLoop]: Abstraction has 1324 states and 3465 transitions. [2025-04-26 16:22:34,450 INFO L340 stractBuchiCegarLoop]: ======== Iteration 53 ============ [2025-04-26 16:22:34,451 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1324 states and 3465 transitions. [2025-04-26 16:22:34,453 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:34,454 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:34,454 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:34,454 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:34,454 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:34,454 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[119] L56-->L57: Formula: (< |v_workerThread1of1ForFork1_i#1_3| 0) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:34,454 INFO L754 eck$LassoCheckResult]: Loop: "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:22:34,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:34,454 INFO L85 PathProgramCache]: Analyzing trace with hash 344965488, now seen corresponding path program 18 times [2025-04-26 16:22:34,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:34,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958743210] [2025-04-26 16:22:34,454 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:34,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:34,456 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:34,456 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:34,456 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:34,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,456 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:34,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:34,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:34,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:34,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:34,458 INFO L85 PathProgramCache]: Analyzing trace with hash -53527749, now seen corresponding path program 29 times [2025-04-26 16:22:34,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:34,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224451107] [2025-04-26 16:22:34,458 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:34,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:34,459 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:34,460 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:34,460 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:34,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,460 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:34,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:34,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:34,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:34,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:34,461 INFO L85 PathProgramCache]: Analyzing trace with hash -205906518, now seen corresponding path program 25 times [2025-04-26 16:22:34,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:34,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377936033] [2025-04-26 16:22:34,461 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:34,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:34,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:34,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:34,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:34,565 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:34,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:34,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377936033] [2025-04-26 16:22:34,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377936033] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:34,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:34,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:22:34,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519290899] [2025-04-26 16:22:34,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:34,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:34,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-26 16:22:34,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-26 16:22:34,595 INFO L87 Difference]: Start difference. First operand 1324 states and 3465 transitions. cyclomatic complexity: 2196 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:34,790 INFO L93 Difference]: Finished difference Result 2033 states and 5137 transitions. [2025-04-26 16:22:34,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2033 states and 5137 transitions. [2025-04-26 16:22:34,797 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:34,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2033 states to 2005 states and 5081 transitions. [2025-04-26 16:22:34,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1187 [2025-04-26 16:22:34,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1187 [2025-04-26 16:22:34,801 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2005 states and 5081 transitions. [2025-04-26 16:22:34,801 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:34,801 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2005 states and 5081 transitions. [2025-04-26 16:22:34,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states and 5081 transitions. [2025-04-26 16:22:34,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1299. [2025-04-26 16:22:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1299 states have (on average 2.6112394149345652) internal successors, (in total 3392), 1298 states have internal predecessors, (3392), 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:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 3392 transitions. [2025-04-26 16:22:34,814 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1299 states and 3392 transitions. [2025-04-26 16:22:34,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:22:34,815 INFO L438 stractBuchiCegarLoop]: Abstraction has 1299 states and 3392 transitions. [2025-04-26 16:22:34,815 INFO L340 stractBuchiCegarLoop]: ======== Iteration 54 ============ [2025-04-26 16:22:34,815 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1299 states and 3392 transitions. [2025-04-26 16:22:34,817 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2025-04-26 16:22:34,817 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:34,817 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:34,818 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:34,818 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:34,818 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" [2025-04-26 16:22:34,818 INFO L754 eck$LassoCheckResult]: Loop: "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" [2025-04-26 16:22:34,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:34,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1203688879, now seen corresponding path program 1 times [2025-04-26 16:22:34,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:34,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715141870] [2025-04-26 16:22:34,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:34,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:34,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:34,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:34,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:34,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:34,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:34,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:34,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:34,823 INFO L85 PathProgramCache]: Analyzing trace with hash -712911557, now seen corresponding path program 30 times [2025-04-26 16:22:34,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:34,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012641486] [2025-04-26 16:22:34,823 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:34,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:34,824 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:34,824 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:34,824 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:34,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,824 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:34,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:34,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:34,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:34,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:34,826 INFO L85 PathProgramCache]: Analyzing trace with hash 908008681, now seen corresponding path program 2 times [2025-04-26 16:22:34,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:34,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893952206] [2025-04-26 16:22:34,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:34,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:34,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-26 16:22:34,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:34,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:22:34,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,829 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:34,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:22:34,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:34,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:35,045 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:35,045 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:35,045 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:35,045 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:35,045 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:35,045 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,045 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:35,045 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:35,045 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration54_Lasso [2025-04-26 16:22:35,045 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:35,046 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:35,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,323 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:22:35,492 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:35,492 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:35,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,494 INFO L229 MonitoredProcess]: Starting monitored process 414 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:35,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (414)] Waiting until timeout for monitored process [2025-04-26 16:22:35,495 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:35,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:35,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:35,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:35,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:35,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:35,508 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (414)] Ended with exit code 0 [2025-04-26 16:22:35,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,516 INFO L229 MonitoredProcess]: Starting monitored process 415 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:35,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (415)] Waiting until timeout for monitored process [2025-04-26 16:22:35,518 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:35,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:35,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:35,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:35,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:35,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:35,531 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (415)] Ended with exit code 0 [2025-04-26 16:22:35,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,538 INFO L229 MonitoredProcess]: Starting monitored process 416 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:35,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (416)] Waiting until timeout for monitored process [2025-04-26 16:22:35,540 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:35,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,550 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:35,550 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:35,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:35,559 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:22:35,559 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:35,585 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (416)] Ended with exit code 0 [2025-04-26 16:22:35,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,592 INFO L229 MonitoredProcess]: Starting monitored process 417 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:35,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (417)] Waiting until timeout for monitored process [2025-04-26 16:22:35,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:22:35,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:35,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:35,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:35,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:35,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:35,607 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (417)] Ended with exit code 0 [2025-04-26 16:22:35,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,614 INFO L229 MonitoredProcess]: Starting monitored process 418 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:35,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (418)] Waiting until timeout for monitored process [2025-04-26 16:22:35,615 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:35,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:35,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:35,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:35,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:35,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:35,628 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (418)] Ended with exit code 0 [2025-04-26 16:22:35,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,635 INFO L229 MonitoredProcess]: Starting monitored process 419 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:35,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (419)] Waiting until timeout for monitored process [2025-04-26 16:22:35,636 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:35,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:35,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:35,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:35,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:35,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:35,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:35,647 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (419)] Ended with exit code 0 [2025-04-26 16:22:35,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,654 INFO L229 MonitoredProcess]: Starting monitored process 420 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:35,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (420)] Waiting until timeout for monitored process [2025-04-26 16:22:35,655 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:35,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:35,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:35,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:35,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:35,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:35,668 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (420)] Ended with exit code 0 [2025-04-26 16:22:35,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,675 INFO L229 MonitoredProcess]: Starting monitored process 421 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:35,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (421)] Waiting until timeout for monitored process [2025-04-26 16:22:35,677 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:35,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:35,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:35,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:35,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:35,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:35,689 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (421)] Ended with exit code 0 [2025-04-26 16:22:35,695 INFO L453 LassoAnalysis]: Using template '2-nested'. [2025-04-26 16:22:35,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,697 INFO L229 MonitoredProcess]: Starting monitored process 422 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:35,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (422)] Waiting until timeout for monitored process [2025-04-26 16:22:35,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:22:35,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:35,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:35,709 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:35,709 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:35,709 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:35,712 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (422)] Ended with exit code 0 [2025-04-26 16:22:35,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,720 INFO L229 MonitoredProcess]: Starting monitored process 423 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:35,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (423)] Waiting until timeout for monitored process [2025-04-26 16:22:35,721 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:35,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:35,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:35,731 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:35,732 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:35,732 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:35,735 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (423)] Ended with exit code 0 [2025-04-26 16:22:35,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,742 INFO L229 MonitoredProcess]: Starting monitored process 424 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:35,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (424)] Waiting until timeout for monitored process [2025-04-26 16:22:35,744 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:35,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,754 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:35,754 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:35,754 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:35,768 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2025-04-26 16:22:35,768 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:35,807 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (424)] Ended with exit code 0 [2025-04-26 16:22:35,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,815 INFO L229 MonitoredProcess]: Starting monitored process 425 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:35,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (425)] Waiting until timeout for monitored process [2025-04-26 16:22:35,817 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:35,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:35,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:35,827 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:35,828 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:35,828 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:35,831 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (425)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:35,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,838 INFO L229 MonitoredProcess]: Starting monitored process 426 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:35,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (426)] Waiting until timeout for monitored process [2025-04-26 16:22:35,840 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:35,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:35,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:35,849 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:35,850 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:35,850 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:35,853 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (426)] Ended with exit code 0 [2025-04-26 16:22:35,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,860 INFO L229 MonitoredProcess]: Starting monitored process 427 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:35,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (427)] Waiting until timeout for monitored process [2025-04-26 16:22:35,861 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:35,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:35,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:35,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:35,871 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:35,871 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:22:35,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:35,872 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (427)] Ended with exit code 0 [2025-04-26 16:22:35,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,879 INFO L229 MonitoredProcess]: Starting monitored process 428 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:35,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (428)] Waiting until timeout for monitored process [2025-04-26 16:22:35,880 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:35,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:35,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:35,890 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:35,891 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:35,891 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:35,894 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (428)] Ended with exit code 0 [2025-04-26 16:22:35,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,901 INFO L229 MonitoredProcess]: Starting monitored process 429 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:35,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (429)] Waiting until timeout for monitored process [2025-04-26 16:22:35,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:22:35,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:35,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:35,912 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:35,913 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:35,913 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:35,915 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (429)] Ended with exit code 0 [2025-04-26 16:22:35,921 INFO L453 LassoAnalysis]: Using template '3-nested'. [2025-04-26 16:22:35,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,923 INFO L229 MonitoredProcess]: Starting monitored process 430 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:35,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (430)] Waiting until timeout for monitored process [2025-04-26 16:22:35,924 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:35,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:35,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:35,934 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:35,935 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:35,935 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:35,938 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (430)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:35,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,945 INFO L229 MonitoredProcess]: Starting monitored process 431 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:35,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (431)] Waiting until timeout for monitored process [2025-04-26 16:22:35,956 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:35,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:35,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:35,967 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:35,968 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:35,968 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:35,973 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (431)] Ended with exit code 0 [2025-04-26 16:22:35,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,979 INFO L229 MonitoredProcess]: Starting monitored process 432 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:35,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (432)] Waiting until timeout for monitored process [2025-04-26 16:22:35,981 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:35,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,991 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:35,991 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:35,991 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:36,009 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:22:36,010 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:22:36,061 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (432)] Ended with exit code 0 [2025-04-26 16:22:36,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,069 INFO L229 MonitoredProcess]: Starting monitored process 433 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:36,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (433)] Waiting until timeout for monitored process [2025-04-26 16:22:36,071 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:36,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:36,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,081 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:36,083 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:36,083 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:36,087 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (433)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:36,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,094 INFO L229 MonitoredProcess]: Starting monitored process 434 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:36,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (434)] Waiting until timeout for monitored process [2025-04-26 16:22:36,096 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:36,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:36,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,105 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:36,107 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:36,107 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:36,110 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (434)] Ended with exit code 0 [2025-04-26 16:22:36,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,117 INFO L229 MonitoredProcess]: Starting monitored process 435 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:36,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (435)] Waiting until timeout for monitored process [2025-04-26 16:22:36,119 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:36,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:36,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:36,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,129 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:36,129 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:22:36,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:36,130 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (435)] Ended with exit code 0 [2025-04-26 16:22:36,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,137 INFO L229 MonitoredProcess]: Starting monitored process 436 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:36,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (436)] Waiting until timeout for monitored process [2025-04-26 16:22:36,139 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:36,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:36,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,149 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:36,150 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:36,150 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:36,153 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (436)] Ended with exit code 0 [2025-04-26 16:22:36,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,161 INFO L229 MonitoredProcess]: Starting monitored process 437 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:36,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (437)] Waiting until timeout for monitored process [2025-04-26 16:22:36,162 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:36,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:36,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,172 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:36,173 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:36,173 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:36,177 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (437)] Ended with exit code 0 [2025-04-26 16:22:36,183 INFO L453 LassoAnalysis]: Using template '4-nested'. [2025-04-26 16:22:36,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,185 INFO L229 MonitoredProcess]: Starting monitored process 438 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:36,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (438)] Waiting until timeout for monitored process [2025-04-26 16:22:36,186 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:36,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:36,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,196 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:36,197 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:36,197 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:36,202 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (438)] Ended with exit code 0 [2025-04-26 16:22:36,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,209 INFO L229 MonitoredProcess]: Starting monitored process 439 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:36,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (439)] Waiting until timeout for monitored process [2025-04-26 16:22:36,211 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:36,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:36,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,221 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:36,223 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:36,223 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:36,229 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (439)] Ended with exit code 0 [2025-04-26 16:22:36,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,237 INFO L229 MonitoredProcess]: Starting monitored process 440 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:36,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (440)] Waiting until timeout for monitored process [2025-04-26 16:22:36,239 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:36,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:36,249 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:36,249 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:36,249 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:36,276 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2025-04-26 16:22:36,276 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2025-04-26 16:22:36,328 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (440)] Ended with exit code 0 [2025-04-26 16:22:36,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,336 INFO L229 MonitoredProcess]: Starting monitored process 441 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:36,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (441)] Waiting until timeout for monitored process [2025-04-26 16:22:36,338 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:36,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:36,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,348 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:36,350 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:36,350 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:36,355 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (441)] Ended with exit code 0 [2025-04-26 16:22:36,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,362 INFO L229 MonitoredProcess]: Starting monitored process 442 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:36,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (442)] Waiting until timeout for monitored process [2025-04-26 16:22:36,363 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:36,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:36,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,373 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:36,374 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:36,374 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:36,378 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (442)] Ended with exit code 0 [2025-04-26 16:22:36,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,385 INFO L229 MonitoredProcess]: Starting monitored process 443 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:36,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (443)] Waiting until timeout for monitored process [2025-04-26 16:22:36,386 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:36,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:36,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:36,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,396 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:36,396 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:22:36,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:36,397 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (443)] Ended with exit code 0 [2025-04-26 16:22:36,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,404 INFO L229 MonitoredProcess]: Starting monitored process 444 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:36,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (444)] Waiting until timeout for monitored process [2025-04-26 16:22:36,405 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:36,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:36,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,416 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:36,417 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:36,417 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:36,421 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (444)] Ended with exit code 0 [2025-04-26 16:22:36,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,427 INFO L229 MonitoredProcess]: Starting monitored process 445 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:36,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (445)] Waiting until timeout for monitored process [2025-04-26 16:22:36,433 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:36,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:36,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,443 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:36,444 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:36,444 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:36,448 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (445)] Ended with exit code 0 [2025-04-26 16:22:36,453 INFO L453 LassoAnalysis]: Using template '2-phase'. [2025-04-26 16:22:36,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,455 INFO L229 MonitoredProcess]: Starting monitored process 446 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:36,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (446)] Waiting until timeout for monitored process [2025-04-26 16:22:36,458 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:36,468 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:36,468 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:36,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,468 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:36,469 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:36,469 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:36,472 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (446)] Ended with exit code 0 [2025-04-26 16:22:36,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,479 INFO L229 MonitoredProcess]: Starting monitored process 447 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:36,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (447)] Waiting until timeout for monitored process [2025-04-26 16:22:36,484 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:36,494 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:36,494 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:36,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,494 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:36,495 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:36,496 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:36,500 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (447)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:36,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,507 INFO L229 MonitoredProcess]: Starting monitored process 448 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:36,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (448)] Waiting until timeout for monitored process [2025-04-26 16:22:36,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:22:36,524 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:36,524 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:36,524 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:36,524 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:36,524 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:36,539 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2025-04-26 16:22:36,539 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:36,600 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (448)] Ended with exit code 0 [2025-04-26 16:22:36,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,608 INFO L229 MonitoredProcess]: Starting monitored process 449 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:36,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (449)] Waiting until timeout for monitored process [2025-04-26 16:22:36,610 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:36,619 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:36,619 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:36,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,620 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:36,621 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:36,621 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:36,625 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (449)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:36,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,632 INFO L229 MonitoredProcess]: Starting monitored process 450 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:36,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (450)] Waiting until timeout for monitored process [2025-04-26 16:22:36,633 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:36,644 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:36,644 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:36,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,644 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:36,645 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:36,645 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:36,648 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (450)] Ended with exit code 0 [2025-04-26 16:22:36,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,682 INFO L229 MonitoredProcess]: Starting monitored process 451 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:36,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (451)] Waiting until timeout for monitored process [2025-04-26 16:22:36,684 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:36,693 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:36,693 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:36,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:36,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,694 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:36,694 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:22:36,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:36,695 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (451)] Ended with exit code 0 [2025-04-26 16:22:36,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,702 INFO L229 MonitoredProcess]: Starting monitored process 452 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:36,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (452)] Waiting until timeout for monitored process [2025-04-26 16:22:36,703 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:36,713 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:36,713 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:36,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,713 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:36,714 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:36,714 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:36,717 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (452)] Ended with exit code 0 [2025-04-26 16:22:36,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,725 INFO L229 MonitoredProcess]: Starting monitored process 453 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:36,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (453)] Waiting until timeout for monitored process [2025-04-26 16:22:36,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:22:36,736 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:36,736 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:36,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,736 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:36,737 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:36,737 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:36,741 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (453)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:36,746 INFO L453 LassoAnalysis]: Using template '3-phase'. [2025-04-26 16:22:36,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,748 INFO L229 MonitoredProcess]: Starting monitored process 454 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:36,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (454)] Waiting until timeout for monitored process [2025-04-26 16:22:36,749 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:36,759 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:36,759 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:36,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,759 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:36,760 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:36,760 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:36,765 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (454)] Ended with exit code 0 [2025-04-26 16:22:36,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,773 INFO L229 MonitoredProcess]: Starting monitored process 455 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:36,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (455)] Waiting until timeout for monitored process [2025-04-26 16:22:36,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:36,784 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:36,784 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:36,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,784 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:36,785 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:36,786 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:36,791 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (455)] Ended with exit code 0 [2025-04-26 16:22:36,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,798 INFO L229 MonitoredProcess]: Starting monitored process 456 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:36,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (456)] Waiting until timeout for monitored process [2025-04-26 16:22:36,800 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:36,810 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:36,810 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:36,810 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:36,810 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:36,810 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:36,829 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:22:36,829 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:22:36,923 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (456)] Ended with exit code 0 [2025-04-26 16:22:36,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,932 INFO L229 MonitoredProcess]: Starting monitored process 457 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:36,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (457)] Waiting until timeout for monitored process [2025-04-26 16:22:36,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:36,943 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:36,943 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:36,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,943 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:36,945 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:36,945 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:36,951 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (457)] Ended with exit code 0 [2025-04-26 16:22:36,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,958 INFO L229 MonitoredProcess]: Starting monitored process 458 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:36,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (458)] Waiting until timeout for monitored process [2025-04-26 16:22:36,959 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:36,969 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:36,969 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:36,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,969 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:36,970 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:36,970 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:36,975 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (458)] Ended with exit code 0 [2025-04-26 16:22:36,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,982 INFO L229 MonitoredProcess]: Starting monitored process 459 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:36,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (459)] Waiting until timeout for monitored process [2025-04-26 16:22:36,985 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:36,994 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:36,994 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:36,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:36,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,995 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:36,995 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:22:36,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:36,997 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:37,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (459)] Ended with exit code 0 [2025-04-26 16:22:37,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,004 INFO L229 MonitoredProcess]: Starting monitored process 460 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:37,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (460)] Waiting until timeout for monitored process [2025-04-26 16:22:37,024 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:37,033 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:37,034 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:37,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:37,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:37,034 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:37,035 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:37,035 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:37,040 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:37,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (460)] Ended with exit code 0 [2025-04-26 16:22:37,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,047 INFO L229 MonitoredProcess]: Starting monitored process 461 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:37,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (461)] Waiting until timeout for monitored process [2025-04-26 16:22:37,048 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:37,058 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:37,058 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:37,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:37,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:37,058 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:37,059 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:37,059 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:37,064 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:37,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (461)] Ended with exit code 0 [2025-04-26 16:22:37,069 INFO L453 LassoAnalysis]: Using template '4-phase'. [2025-04-26 16:22:37,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,071 INFO L229 MonitoredProcess]: Starting monitored process 462 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:37,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (462)] Waiting until timeout for monitored process [2025-04-26 16:22:37,072 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:37,082 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:37,083 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:37,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:37,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:37,083 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:37,084 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:37,084 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:37,091 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:37,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (462)] Ended with exit code 0 [2025-04-26 16:22:37,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,100 INFO L229 MonitoredProcess]: Starting monitored process 463 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:37,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (463)] Waiting until timeout for monitored process [2025-04-26 16:22:37,102 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:37,112 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:37,112 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:37,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:37,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:37,112 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:37,114 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:37,114 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:37,122 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:37,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (463)] Ended with exit code 0 [2025-04-26 16:22:37,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,130 INFO L229 MonitoredProcess]: Starting monitored process 464 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:37,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (464)] Waiting until timeout for monitored process [2025-04-26 16:22:37,131 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:37,141 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:37,141 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:37,142 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:37,142 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:37,142 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:37,167 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2025-04-26 16:22:37,167 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2025-04-26 16:22:37,437 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:37,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (464)] Ended with exit code 0 [2025-04-26 16:22:37,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,460 INFO L229 MonitoredProcess]: Starting monitored process 465 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:37,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (465)] Waiting until timeout for monitored process [2025-04-26 16:22:37,462 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:37,472 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:37,472 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:37,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:37,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:37,472 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:37,474 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:37,474 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:37,483 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:37,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (465)] Ended with exit code 0 [2025-04-26 16:22:37,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,490 INFO L229 MonitoredProcess]: Starting monitored process 466 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:37,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (466)] Waiting until timeout for monitored process [2025-04-26 16:22:37,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:22:37,503 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:37,503 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:37,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:37,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:37,503 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:37,505 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:37,505 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:37,512 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:37,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (466)] Ended with exit code 0 [2025-04-26 16:22:37,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,519 INFO L229 MonitoredProcess]: Starting monitored process 467 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:37,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (467)] Waiting until timeout for monitored process [2025-04-26 16:22:37,520 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:37,530 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:37,530 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:37,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:37,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:37,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:37,530 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:37,531 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:22:37,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:37,533 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:37,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (467)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:37,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,540 INFO L229 MonitoredProcess]: Starting monitored process 468 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:37,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (468)] Waiting until timeout for monitored process [2025-04-26 16:22:37,542 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:37,551 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:37,551 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:37,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:37,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:37,551 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:37,553 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:37,553 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:37,559 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:37,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (468)] Ended with exit code 0 [2025-04-26 16:22:37,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,566 INFO L229 MonitoredProcess]: Starting monitored process 469 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:37,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (469)] Waiting until timeout for monitored process [2025-04-26 16:22:37,567 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:37,577 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:37,577 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:37,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:37,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:37,577 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:37,579 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:37,579 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:37,585 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:37,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (469)] Ended with exit code 0 [2025-04-26 16:22:37,591 INFO L453 LassoAnalysis]: Using template '2-lex'. [2025-04-26 16:22:37,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,593 INFO L229 MonitoredProcess]: Starting monitored process 470 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:37,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (470)] Waiting until timeout for monitored process [2025-04-26 16:22:37,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:22:37,604 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:37,604 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:37,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:37,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:37,604 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:37,605 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:37,605 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:37,608 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:37,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (470)] Ended with exit code 0 [2025-04-26 16:22:37,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,616 INFO L229 MonitoredProcess]: Starting monitored process 471 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:37,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (471)] Waiting until timeout for monitored process [2025-04-26 16:22:37,617 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:37,627 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:37,627 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:37,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:37,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:37,627 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:37,628 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:37,628 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:37,634 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:37,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (471)] Ended with exit code 0 [2025-04-26 16:22:37,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,641 INFO L229 MonitoredProcess]: Starting monitored process 472 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:37,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (472)] Waiting until timeout for monitored process [2025-04-26 16:22:37,642 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:37,652 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:37,652 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:37,652 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:37,652 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:37,652 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:37,670 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:22:37,670 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:22:37,770 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:37,862 INFO L436 ModelExtractionUtils]: Simplification made 34 calls to the SMT solver. [2025-04-26 16:22:37,862 INFO L437 ModelExtractionUtils]: 33 out of 62 variables were initially zero. Simplification set additionally 21 variables to zero. [2025-04-26 16:22:37,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,864 INFO L229 MonitoredProcess]: Starting monitored process 473 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:37,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (473)] Waiting until timeout for monitored process [2025-04-26 16:22:37,865 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:37,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (473)] Ended with exit code 0 [2025-04-26 16:22:37,885 INFO L439 nArgumentSynthesizer]: Removed 7 redundant supporting invariants from a total of 8. [2025-04-26 16:22:37,885 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:37,885 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function 2-lexicographic ranking function: f(N, cnt, workerWithAssertThread1of1ForFork0_steal_x#1) = Supporting invariants [-3*cnt + 4*N >= 0] [2025-04-26 16:22:37,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (472)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:37,895 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:37,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:37,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:37,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:37,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:37,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:37,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:37,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:37,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:37,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:37,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:37,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:37,923 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:37,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:37,972 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:37,973 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 16:22:37,973 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1299 states and 3392 transitions. cyclomatic complexity: 2148 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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:22:38,116 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1299 states and 3392 transitions. cyclomatic complexity: 2148. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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) Result 2320 states and 5975 transitions. Complement of second has 15 states. [2025-04-26 16:22:38,116 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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:22:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2025-04-26 16:22:38,116 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 90 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:38,116 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:38,116 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:38,123 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:38,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:38,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:38,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:38,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:38,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:38,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:38,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:38,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:38,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:38,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:38,145 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:38,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:38,193 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:38,194 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 16:22:38,194 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1299 states and 3392 transitions. cyclomatic complexity: 2148 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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:22:38,318 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1299 states and 3392 transitions. cyclomatic complexity: 2148. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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) Result 2320 states and 5975 transitions. Complement of second has 15 states. [2025-04-26 16:22:38,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:38,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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:22:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2025-04-26 16:22:38,319 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 90 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:38,319 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:38,319 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:38,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:38,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:38,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:38,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:38,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:38,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:38,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:38,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:38,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:38,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:38,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:38,346 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:38,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:38,394 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:38,394 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 5 loop predicates [2025-04-26 16:22:38,394 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1299 states and 3392 transitions. cyclomatic complexity: 2148 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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:22:38,566 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1299 states and 3392 transitions. cyclomatic complexity: 2148. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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) Result 2730 states and 7104 transitions. Complement of second has 14 states. [2025-04-26 16:22:38,566 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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:22:38,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2025-04-26 16:22:38,567 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 118 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:38,567 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:38,567 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 118 transitions. Stem has 26 letters. Loop has 8 letters. [2025-04-26 16:22:38,567 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:38,567 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 118 transitions. Stem has 18 letters. Loop has 16 letters. [2025-04-26 16:22:38,567 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:38,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2730 states and 7104 transitions. [2025-04-26 16:22:38,578 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 488 [2025-04-26 16:22:38,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2730 states to 1860 states and 4785 transitions. [2025-04-26 16:22:38,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 978 [2025-04-26 16:22:38,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1092 [2025-04-26 16:22:38,584 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1860 states and 4785 transitions. [2025-04-26 16:22:38,584 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:38,584 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1860 states and 4785 transitions. [2025-04-26 16:22:38,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states and 4785 transitions. [2025-04-26 16:22:38,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1089. [2025-04-26 16:22:38,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 1089 states have (on average 2.5922865013774103) internal successors, (in total 2823), 1088 states have internal predecessors, (2823), 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:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 2823 transitions. [2025-04-26 16:22:38,597 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1089 states and 2823 transitions. [2025-04-26 16:22:38,597 INFO L438 stractBuchiCegarLoop]: Abstraction has 1089 states and 2823 transitions. [2025-04-26 16:22:38,597 INFO L340 stractBuchiCegarLoop]: ======== Iteration 55 ============ [2025-04-26 16:22:38,597 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1089 states and 2823 transitions. [2025-04-26 16:22:38,600 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 444 [2025-04-26 16:22:38,600 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:38,600 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:38,601 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:38,601 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:38,601 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:38,601 INFO L754 eck$LassoCheckResult]: Loop: "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:38,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:38,601 INFO L85 PathProgramCache]: Analyzing trace with hash -705574339, now seen corresponding path program 1 times [2025-04-26 16:22:38,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:38,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40310449] [2025-04-26 16:22:38,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:38,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:38,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:38,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:38,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:38,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:38,604 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:38,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:38,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:38,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:38,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:38,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:38,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:38,606 INFO L85 PathProgramCache]: Analyzing trace with hash -809624879, now seen corresponding path program 1 times [2025-04-26 16:22:38,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:38,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729076202] [2025-04-26 16:22:38,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:38,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:38,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:38,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:38,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:38,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:38,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:38,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:38,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:38,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:38,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:38,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:38,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:38,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1800671987, now seen corresponding path program 1 times [2025-04-26 16:22:38,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:38,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083856636] [2025-04-26 16:22:38,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:38,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:38,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 16:22:38,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 16:22:38,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:38,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:38,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:38,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 16:22:38,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 16:22:38,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:38,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:38,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:38,802 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:38,802 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:38,802 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:38,802 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:38,802 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:38,802 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:38,802 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:38,802 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:38,802 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration55_Lasso [2025-04-26 16:22:38,802 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:38,802 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:38,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:38,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:38,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:38,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:38,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:38,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:38,932 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:38,932 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:38,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:38,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:38,934 INFO L229 MonitoredProcess]: Starting monitored process 474 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:38,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (474)] Waiting until timeout for monitored process [2025-04-26 16:22:38,936 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:38,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:38,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:38,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:38,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:38,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:38,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:38,949 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:38,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (474)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:38,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:38,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:38,955 INFO L229 MonitoredProcess]: Starting monitored process 475 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:38,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (475)] Waiting until timeout for monitored process [2025-04-26 16:22:38,960 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:38,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:38,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:38,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:38,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:38,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:38,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:38,972 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:38,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (475)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:38,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:38,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:38,979 INFO L229 MonitoredProcess]: Starting monitored process 476 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:38,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (476)] Waiting until timeout for monitored process [2025-04-26 16:22:38,985 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:38,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:38,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:38,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:38,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:38,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:38,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:38,998 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:39,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (476)] Ended with exit code 0 [2025-04-26 16:22:39,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:39,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:39,004 INFO L229 MonitoredProcess]: Starting monitored process 477 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:39,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (477)] Waiting until timeout for monitored process [2025-04-26 16:22:39,009 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:39,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:39,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:39,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:39,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:39,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:39,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:39,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:39,021 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:39,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (477)] Ended with exit code 0 [2025-04-26 16:22:39,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:39,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:39,030 INFO L229 MonitoredProcess]: Starting monitored process 478 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:39,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (478)] Waiting until timeout for monitored process [2025-04-26 16:22:39,031 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:39,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:39,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:39,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:39,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:39,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:39,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:39,045 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:39,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (478)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:39,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:39,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:39,052 INFO L229 MonitoredProcess]: Starting monitored process 479 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:39,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (479)] Waiting until timeout for monitored process [2025-04-26 16:22:39,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:39,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:39,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:39,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:39,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:39,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:39,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:39,075 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:39,080 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:22:39,080 INFO L437 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:39,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:39,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:39,082 INFO L229 MonitoredProcess]: Starting monitored process 480 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:39,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (480)] Waiting until timeout for monitored process [2025-04-26 16:22:39,083 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:39,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (480)] Ended with exit code 0 [2025-04-26 16:22:39,098 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:39,099 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:39,099 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(cnt, N) = -1*cnt + 1*N Supporting invariants [] [2025-04-26 16:22:39,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (479)] Ended with exit code 0 [2025-04-26 16:22:39,106 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:39,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:39,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:39,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:39,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:39,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:39,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:39,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:39,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:39,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:39,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:39,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:39,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 16:22:39,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:39,259 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:39,259 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-04-26 16:22:39,260 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1089 states and 2823 transitions. cyclomatic complexity: 1769 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (in total 30), 8 states have internal predecessors, (30), 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:39,570 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1089 states and 2823 transitions. cyclomatic complexity: 1769. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (in total 30), 8 states have internal predecessors, (30), 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 4555 states and 11822 transitions. Complement of second has 23 states. [2025-04-26 16:22:39,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (in total 30), 8 states have internal predecessors, (30), 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:39,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 119 transitions. [2025-04-26 16:22:39,571 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 12 states and 119 transitions. Stem has 14 letters. Loop has 16 letters. [2025-04-26 16:22:39,571 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:39,571 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 12 states and 119 transitions. Stem has 30 letters. Loop has 16 letters. [2025-04-26 16:22:39,571 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:39,571 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 12 states and 119 transitions. Stem has 14 letters. Loop has 32 letters. [2025-04-26 16:22:39,572 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:39,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4555 states and 11822 transitions. [2025-04-26 16:22:39,589 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 864 [2025-04-26 16:22:39,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4555 states to 4061 states and 10445 transitions. [2025-04-26 16:22:39,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1726 [2025-04-26 16:22:39,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1862 [2025-04-26 16:22:39,604 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4061 states and 10445 transitions. [2025-04-26 16:22:39,604 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:39,604 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4061 states and 10445 transitions. [2025-04-26 16:22:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4061 states and 10445 transitions. [2025-04-26 16:22:39,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4061 to 3229. [2025-04-26 16:22:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3229 states, 3229 states have (on average 2.6364199442551874) internal successors, (in total 8513), 3228 states have internal predecessors, (8513), 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:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 8513 transitions. [2025-04-26 16:22:39,661 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3229 states and 8513 transitions. [2025-04-26 16:22:39,661 INFO L438 stractBuchiCegarLoop]: Abstraction has 3229 states and 8513 transitions. [2025-04-26 16:22:39,661 INFO L340 stractBuchiCegarLoop]: ======== Iteration 56 ============ [2025-04-26 16:22:39,661 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3229 states and 8513 transitions. [2025-04-26 16:22:39,669 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 832 [2025-04-26 16:22:39,670 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:39,670 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:39,670 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:39,670 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:39,670 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" [2025-04-26 16:22:39,671 INFO L754 eck$LassoCheckResult]: Loop: "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" [2025-04-26 16:22:39,671 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:39,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1988353307, now seen corresponding path program 2 times [2025-04-26 16:22:39,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:39,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123869299] [2025-04-26 16:22:39,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:39,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:39,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:39,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:39,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:39,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:39,673 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:39,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:39,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:39,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:39,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:39,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:39,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:39,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1140133723, now seen corresponding path program 25 times [2025-04-26 16:22:39,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:39,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283173691] [2025-04-26 16:22:39,676 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:39,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:39,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:39,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:39,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:39,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:39,678 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:39,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:39,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:39,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:39,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:39,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:39,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:39,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1256059329, now seen corresponding path program 3 times [2025-04-26 16:22:39,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:39,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272859508] [2025-04-26 16:22:39,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:39,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:39,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-26 16:22:39,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:39,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:22:39,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:39,686 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:39,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:22:39,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:39,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:39,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:39,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:39,912 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:39,912 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:39,912 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:39,912 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:39,913 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:39,913 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:39,913 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:39,913 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:39,913 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration56_Lasso [2025-04-26 16:22:39,913 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:39,913 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:39,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:39,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:39,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:39,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:40,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:40,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:40,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:40,175 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:22:40,347 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:40,347 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:40,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,349 INFO L229 MonitoredProcess]: Starting monitored process 481 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:40,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (481)] Waiting until timeout for monitored process [2025-04-26 16:22:40,350 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:40,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:40,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:40,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:40,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:40,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:40,363 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (481)] Ended with exit code 0 [2025-04-26 16:22:40,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,370 INFO L229 MonitoredProcess]: Starting monitored process 482 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:40,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (482)] Waiting until timeout for monitored process [2025-04-26 16:22:40,371 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:40,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:40,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:40,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:40,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:40,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:40,384 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (482)] Ended with exit code 0 [2025-04-26 16:22:40,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,392 INFO L229 MonitoredProcess]: Starting monitored process 483 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:40,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (483)] Waiting until timeout for monitored process [2025-04-26 16:22:40,394 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:40,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:40,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:40,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:40,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:40,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:40,406 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (483)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:40,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,413 INFO L229 MonitoredProcess]: Starting monitored process 484 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:40,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (484)] Waiting until timeout for monitored process [2025-04-26 16:22:40,415 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:40,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,425 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:40,425 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:40,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:40,434 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:22:40,435 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:40,462 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (484)] Ended with exit code 0 [2025-04-26 16:22:40,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,470 INFO L229 MonitoredProcess]: Starting monitored process 485 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:40,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (485)] Waiting until timeout for monitored process [2025-04-26 16:22:40,472 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:40,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:40,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:40,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:40,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:40,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:40,485 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (485)] Ended with exit code 0 [2025-04-26 16:22:40,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,492 INFO L229 MonitoredProcess]: Starting monitored process 486 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:40,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (486)] Waiting until timeout for monitored process [2025-04-26 16:22:40,493 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:40,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:40,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:40,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:40,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:40,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:40,507 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (486)] Ended with exit code 0 [2025-04-26 16:22:40,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,514 INFO L229 MonitoredProcess]: Starting monitored process 487 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:40,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (487)] Waiting until timeout for monitored process [2025-04-26 16:22:40,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:40,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:40,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:40,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:40,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:40,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:40,528 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (487)] Ended with exit code 0 [2025-04-26 16:22:40,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,535 INFO L229 MonitoredProcess]: Starting monitored process 488 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:40,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (488)] Waiting until timeout for monitored process [2025-04-26 16:22:40,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:22:40,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:40,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:40,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:40,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:40,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:40,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:40,548 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (488)] Ended with exit code 0 [2025-04-26 16:22:40,553 INFO L453 LassoAnalysis]: Using template '2-nested'. [2025-04-26 16:22:40,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,555 INFO L229 MonitoredProcess]: Starting monitored process 489 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:40,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (489)] Waiting until timeout for monitored process [2025-04-26 16:22:40,556 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:40,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:40,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:40,566 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:40,567 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:40,567 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:40,570 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (489)] Ended with exit code 0 [2025-04-26 16:22:40,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,577 INFO L229 MonitoredProcess]: Starting monitored process 490 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:40,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (490)] Waiting until timeout for monitored process [2025-04-26 16:22:40,579 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:40,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:40,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:40,589 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:40,590 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:40,590 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:40,593 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (490)] Ended with exit code 0 [2025-04-26 16:22:40,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,600 INFO L229 MonitoredProcess]: Starting monitored process 491 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:40,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (491)] Waiting until timeout for monitored process [2025-04-26 16:22:40,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:40,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:40,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:40,612 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:40,612 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:40,613 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:40,615 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (491)] Ended with exit code 0 [2025-04-26 16:22:40,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,623 INFO L229 MonitoredProcess]: Starting monitored process 492 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:40,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (492)] Waiting until timeout for monitored process [2025-04-26 16:22:40,624 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:40,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,634 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:40,634 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:40,634 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:40,648 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2025-04-26 16:22:40,649 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:40,688 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (492)] Ended with exit code 0 [2025-04-26 16:22:40,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,696 INFO L229 MonitoredProcess]: Starting monitored process 493 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:40,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (493)] Waiting until timeout for monitored process [2025-04-26 16:22:40,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:22:40,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:40,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:40,707 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:40,708 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:40,708 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:40,712 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (493)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:40,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,719 INFO L229 MonitoredProcess]: Starting monitored process 494 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:40,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (494)] Waiting until timeout for monitored process [2025-04-26 16:22:40,721 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:40,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:40,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:40,731 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:40,732 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:40,732 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:40,736 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (494)] Ended with exit code 0 [2025-04-26 16:22:40,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,742 INFO L229 MonitoredProcess]: Starting monitored process 495 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:40,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (495)] Waiting until timeout for monitored process [2025-04-26 16:22:40,744 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:40,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:40,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:40,754 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:40,755 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:40,755 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:40,757 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (495)] Ended with exit code 0 [2025-04-26 16:22:40,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,764 INFO L229 MonitoredProcess]: Starting monitored process 496 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:40,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (496)] Waiting until timeout for monitored process [2025-04-26 16:22:40,766 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:40,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:40,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:40,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:40,776 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:40,776 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:22:40,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:40,777 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (496)] Ended with exit code 0 [2025-04-26 16:22:40,782 INFO L453 LassoAnalysis]: Using template '3-nested'. [2025-04-26 16:22:40,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,784 INFO L229 MonitoredProcess]: Starting monitored process 497 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:40,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (497)] Waiting until timeout for monitored process [2025-04-26 16:22:40,785 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:40,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:40,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:40,795 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:40,796 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:40,796 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:40,799 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (497)] Ended with exit code 0 [2025-04-26 16:22:40,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,806 INFO L229 MonitoredProcess]: Starting monitored process 498 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:40,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (498)] Waiting until timeout for monitored process [2025-04-26 16:22:40,824 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:40,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:40,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:40,834 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:40,836 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:40,836 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:40,840 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (498)] Ended with exit code 0 [2025-04-26 16:22:40,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,850 INFO L229 MonitoredProcess]: Starting monitored process 499 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:40,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (499)] Waiting until timeout for monitored process [2025-04-26 16:22:40,852 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:40,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:40,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:40,862 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:40,864 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:40,864 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:40,868 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (499)] Ended with exit code 0 [2025-04-26 16:22:40,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,880 INFO L229 MonitoredProcess]: Starting monitored process 500 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:40,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (500)] Waiting until timeout for monitored process [2025-04-26 16:22:40,882 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:40,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,894 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:40,894 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:40,894 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:40,913 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:22:40,913 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:22:40,958 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (500)] Ended with exit code 0 [2025-04-26 16:22:40,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,966 INFO L229 MonitoredProcess]: Starting monitored process 501 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:40,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (501)] Waiting until timeout for monitored process [2025-04-26 16:22:40,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:22:40,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:40,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:40,978 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:40,979 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:40,979 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:40,984 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (501)] Ended with exit code 0 [2025-04-26 16:22:40,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,991 INFO L229 MonitoredProcess]: Starting monitored process 502 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:40,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (502)] Waiting until timeout for monitored process [2025-04-26 16:22:40,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:41,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,003 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:41,004 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:41,004 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:41,008 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (502)] Ended with exit code 0 [2025-04-26 16:22:41,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,015 INFO L229 MonitoredProcess]: Starting monitored process 503 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (503)] Waiting until timeout for monitored process [2025-04-26 16:22:41,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:41,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,027 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:41,028 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:41,028 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:41,031 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (503)] Ended with exit code 0 [2025-04-26 16:22:41,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,038 INFO L229 MonitoredProcess]: Starting monitored process 504 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (504)] Waiting until timeout for monitored process [2025-04-26 16:22:41,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:41,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:41,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,050 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:41,050 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:22:41,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:41,052 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (504)] Ended with exit code 0 [2025-04-26 16:22:41,057 INFO L453 LassoAnalysis]: Using template '4-nested'. [2025-04-26 16:22:41,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,059 INFO L229 MonitoredProcess]: Starting monitored process 505 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (505)] Waiting until timeout for monitored process [2025-04-26 16:22:41,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:41,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,071 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:41,073 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:41,073 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:41,078 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (505)] Ended with exit code 0 [2025-04-26 16:22:41,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,086 INFO L229 MonitoredProcess]: Starting monitored process 506 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (506)] Waiting until timeout for monitored process [2025-04-26 16:22:41,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:41,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,098 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:41,100 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:41,100 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:41,104 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (506)] Ended with exit code 0 [2025-04-26 16:22:41,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,112 INFO L229 MonitoredProcess]: Starting monitored process 507 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (507)] Waiting until timeout for monitored process [2025-04-26 16:22:41,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:41,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,124 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:41,126 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:41,126 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:41,130 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (507)] Ended with exit code 0 [2025-04-26 16:22:41,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,137 INFO L229 MonitoredProcess]: Starting monitored process 508 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (508)] Waiting until timeout for monitored process [2025-04-26 16:22:41,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:41,149 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:41,149 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:41,149 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:41,172 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2025-04-26 16:22:41,172 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2025-04-26 16:22:41,226 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (508)] Ended with exit code 0 [2025-04-26 16:22:41,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,234 INFO L229 MonitoredProcess]: Starting monitored process 509 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (509)] Waiting until timeout for monitored process [2025-04-26 16:22:41,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:41,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,245 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:41,247 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:41,247 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:41,253 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (509)] Ended with exit code 0 [2025-04-26 16:22:41,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,259 INFO L229 MonitoredProcess]: Starting monitored process 510 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (510)] Waiting until timeout for monitored process [2025-04-26 16:22:41,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:41,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,271 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:41,273 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:41,273 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:41,278 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (510)] Ended with exit code 0 [2025-04-26 16:22:41,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,285 INFO L229 MonitoredProcess]: Starting monitored process 511 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (511)] Waiting until timeout for monitored process [2025-04-26 16:22:41,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:41,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,297 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:41,298 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:41,298 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:41,302 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (511)] Ended with exit code 0 [2025-04-26 16:22:41,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,310 INFO L229 MonitoredProcess]: Starting monitored process 512 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (512)] Waiting until timeout for monitored process [2025-04-26 16:22:41,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:41,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:41,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,325 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:41,325 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:22:41,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:41,326 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (512)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:41,331 INFO L453 LassoAnalysis]: Using template '2-phase'. [2025-04-26 16:22:41,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,333 INFO L229 MonitoredProcess]: Starting monitored process 513 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (513)] Waiting until timeout for monitored process [2025-04-26 16:22:41,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,344 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:41,344 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:41,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,344 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:41,345 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:41,345 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:41,349 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (513)] Ended with exit code 0 [2025-04-26 16:22:41,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,356 INFO L229 MonitoredProcess]: Starting monitored process 514 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (514)] Waiting until timeout for monitored process [2025-04-26 16:22:41,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,367 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:41,367 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:41,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,367 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:41,368 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:41,368 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:41,371 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (514)] Ended with exit code 0 [2025-04-26 16:22:41,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,378 INFO L229 MonitoredProcess]: Starting monitored process 515 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (515)] Waiting until timeout for monitored process [2025-04-26 16:22:41,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,389 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:41,389 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:41,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,390 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:41,391 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:41,391 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:41,394 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (515)] Ended with exit code 0 [2025-04-26 16:22:41,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,401 INFO L229 MonitoredProcess]: Starting monitored process 516 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (516)] Waiting until timeout for monitored process [2025-04-26 16:22:41,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,412 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:41,413 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:41,413 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:41,413 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:41,413 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:41,427 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2025-04-26 16:22:41,427 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:41,492 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (516)] Ended with exit code 0 [2025-04-26 16:22:41,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,500 INFO L229 MonitoredProcess]: Starting monitored process 517 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (517)] Waiting until timeout for monitored process [2025-04-26 16:22:41,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,511 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:41,512 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:41,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,512 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:41,513 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:41,513 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:41,518 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (517)] Ended with exit code 0 [2025-04-26 16:22:41,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,526 INFO L229 MonitoredProcess]: Starting monitored process 518 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (518)] Waiting until timeout for monitored process [2025-04-26 16:22:41,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:41,537 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:41,537 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:41,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,537 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:41,539 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:41,539 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:41,544 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (518)] Ended with exit code 0 [2025-04-26 16:22:41,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,552 INFO L229 MonitoredProcess]: Starting monitored process 519 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (519)] Waiting until timeout for monitored process [2025-04-26 16:22:41,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,563 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:41,563 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:41,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,564 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:41,565 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:41,565 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:41,568 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (519)] Ended with exit code 0 [2025-04-26 16:22:41,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,575 INFO L229 MonitoredProcess]: Starting monitored process 520 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (520)] Waiting until timeout for monitored process [2025-04-26 16:22:41,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:22:41,586 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:41,586 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:41,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:41,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,587 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:41,587 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:22:41,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:41,588 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (520)] Ended with exit code 0 [2025-04-26 16:22:41,594 INFO L453 LassoAnalysis]: Using template '3-phase'. [2025-04-26 16:22:41,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,619 INFO L229 MonitoredProcess]: Starting monitored process 521 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (521)] Waiting until timeout for monitored process [2025-04-26 16:22:41,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,630 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:41,630 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:41,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,630 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:41,632 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:41,632 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:41,637 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (521)] Ended with exit code 0 [2025-04-26 16:22:41,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,645 INFO L229 MonitoredProcess]: Starting monitored process 522 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (522)] Waiting until timeout for monitored process [2025-04-26 16:22:41,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:22:41,656 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:41,657 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:41,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,657 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:41,658 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:41,658 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:41,663 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (522)] Ended with exit code 0 [2025-04-26 16:22:41,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,670 INFO L229 MonitoredProcess]: Starting monitored process 523 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (523)] Waiting until timeout for monitored process [2025-04-26 16:22:41,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,681 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:41,681 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:41,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,681 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:41,683 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:41,683 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:41,687 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (523)] Ended with exit code 0 [2025-04-26 16:22:41,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,695 INFO L229 MonitoredProcess]: Starting monitored process 524 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (524)] Waiting until timeout for monitored process [2025-04-26 16:22:41,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,707 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:41,707 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:41,707 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:41,707 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:41,707 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:41,727 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:22:41,728 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:22:41,829 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (524)] Ended with exit code 0 [2025-04-26 16:22:41,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,839 INFO L229 MonitoredProcess]: Starting monitored process 525 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (525)] Waiting until timeout for monitored process [2025-04-26 16:22:41,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,851 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:41,851 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:41,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,851 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:41,853 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:41,853 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:41,861 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (525)] Ended with exit code 0 [2025-04-26 16:22:41,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,871 INFO L229 MonitoredProcess]: Starting monitored process 526 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (526)] Waiting until timeout for monitored process [2025-04-26 16:22:41,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,885 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:41,885 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:41,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,885 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:41,887 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:41,887 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:41,897 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (526)] Ended with exit code 0 [2025-04-26 16:22:41,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,905 INFO L229 MonitoredProcess]: Starting monitored process 527 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (527)] Waiting until timeout for monitored process [2025-04-26 16:22:41,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,920 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:41,920 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:41,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,921 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:41,922 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:41,922 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:41,927 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (527)] Ended with exit code 0 [2025-04-26 16:22:41,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,937 INFO L229 MonitoredProcess]: Starting monitored process 528 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (528)] Waiting until timeout for monitored process [2025-04-26 16:22:41,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,954 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:41,954 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:22:41,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:41,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,954 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:41,954 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:22:41,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:41,957 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:41,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (528)] Ended with exit code 0 [2025-04-26 16:22:41,963 INFO L453 LassoAnalysis]: Using template '4-phase'. [2025-04-26 16:22:41,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,964 INFO L229 MonitoredProcess]: Starting monitored process 529 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:41,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (529)] Waiting until timeout for monitored process [2025-04-26 16:22:41,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:41,981 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:41,981 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:41,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,981 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:41,983 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:41,983 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:41,991 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:42,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (529)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:42,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,002 INFO L229 MonitoredProcess]: Starting monitored process 530 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:42,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (530)] Waiting until timeout for monitored process [2025-04-26 16:22:42,005 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:42,016 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:42,017 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:42,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:42,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:42,017 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:42,019 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:42,019 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:42,027 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:42,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (530)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:42,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,036 INFO L229 MonitoredProcess]: Starting monitored process 531 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:42,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (531)] Waiting until timeout for monitored process [2025-04-26 16:22:42,038 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:42,049 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:42,049 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:42,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:42,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:42,049 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:42,051 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:42,051 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:42,058 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:42,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (531)] Ended with exit code 0 [2025-04-26 16:22:42,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,068 INFO L229 MonitoredProcess]: Starting monitored process 532 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:42,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (532)] Waiting until timeout for monitored process [2025-04-26 16:22:42,073 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:42,085 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:42,086 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:42,086 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:42,086 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:42,086 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:42,114 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2025-04-26 16:22:42,115 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2025-04-26 16:22:42,541 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:42,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (532)] Ended with exit code 0 [2025-04-26 16:22:42,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,550 INFO L229 MonitoredProcess]: Starting monitored process 533 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:42,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (533)] Waiting until timeout for monitored process [2025-04-26 16:22:42,552 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:42,562 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:42,562 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:42,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:42,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:42,562 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:42,564 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:42,564 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:42,573 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:42,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (533)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:42,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,581 INFO L229 MonitoredProcess]: Starting monitored process 534 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:42,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (534)] Waiting until timeout for monitored process [2025-04-26 16:22:42,582 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:42,592 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:42,593 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:42,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:42,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:42,593 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:42,595 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:42,595 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:42,606 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:42,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (534)] Ended with exit code 0 [2025-04-26 16:22:42,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,641 INFO L229 MonitoredProcess]: Starting monitored process 535 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:42,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (535)] Waiting until timeout for monitored process [2025-04-26 16:22:42,642 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:42,653 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:42,653 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:42,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:42,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:42,653 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:42,655 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:42,655 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:42,678 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:42,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (535)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:42,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,686 INFO L229 MonitoredProcess]: Starting monitored process 536 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:42,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (536)] Waiting until timeout for monitored process [2025-04-26 16:22:42,687 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:42,697 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:42,697 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:22:42,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:42,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:42,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:42,697 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:42,698 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:22:42,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:42,700 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:42,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (536)] Ended with exit code 0 [2025-04-26 16:22:42,706 INFO L453 LassoAnalysis]: Using template '2-lex'. [2025-04-26 16:22:42,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,708 INFO L229 MonitoredProcess]: Starting monitored process 537 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:42,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (537)] Waiting until timeout for monitored process [2025-04-26 16:22:42,709 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:42,719 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:42,719 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:42,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:42,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:42,719 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:42,720 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:42,720 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:42,724 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:42,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (537)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:42,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,731 INFO L229 MonitoredProcess]: Starting monitored process 538 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:42,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (538)] Waiting until timeout for monitored process [2025-04-26 16:22:42,732 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:42,742 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:42,742 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:42,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:42,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:42,742 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:42,744 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:42,744 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:42,748 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:42,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (538)] Ended with exit code 0 [2025-04-26 16:22:42,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,755 INFO L229 MonitoredProcess]: Starting monitored process 539 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:42,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (539)] Waiting until timeout for monitored process [2025-04-26 16:22:42,756 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:42,766 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:42,766 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:42,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:42,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:42,766 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:42,767 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:42,767 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:42,770 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:42,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (539)] Ended with exit code 0 [2025-04-26 16:22:42,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,778 INFO L229 MonitoredProcess]: Starting monitored process 540 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:42,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (540)] Waiting until timeout for monitored process [2025-04-26 16:22:42,780 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:42,790 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:22:42,790 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:22:42,790 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:42,790 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:42,790 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:42,808 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:22:42,808 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:22:42,898 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:42,959 INFO L436 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2025-04-26 16:22:42,959 INFO L437 ModelExtractionUtils]: 34 out of 62 variables were initially zero. Simplification set additionally 20 variables to zero. [2025-04-26 16:22:42,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,960 INFO L229 MonitoredProcess]: Starting monitored process 541 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:42,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (541)] Waiting until timeout for monitored process [2025-04-26 16:22:42,962 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:42,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (541)] Ended with exit code 0 [2025-04-26 16:22:42,983 INFO L439 nArgumentSynthesizer]: Removed 7 redundant supporting invariants from a total of 8. [2025-04-26 16:22:42,983 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:42,983 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function 2-lexicographic ranking function: f(N, cnt, workerThread1of1ForFork1_steal_x#1) = Supporting invariants [4*N - 3*cnt >= 0] [2025-04-26 16:22:42,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (540)] Ended with exit code 0 [2025-04-26 16:22:42,993 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:43,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:43,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:43,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:43,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:43,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:43,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:43,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:43,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:43,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:43,022 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:43,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:22:43,071 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 16:22:43,071 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3229 states and 8513 transitions. cyclomatic complexity: 5378 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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:22:43,228 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3229 states and 8513 transitions. cyclomatic complexity: 5378. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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) Result 5850 states and 15306 transitions. Complement of second has 15 states. [2025-04-26 16:22:43,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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:22:43,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2025-04-26 16:22:43,229 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 82 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:43,229 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:43,229 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:43,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:43,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:43,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:43,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:43,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:43,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:43,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:43,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:43,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:43,260 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:43,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:22:43,311 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 16:22:43,312 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3229 states and 8513 transitions. cyclomatic complexity: 5378 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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:22:43,439 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3229 states and 8513 transitions. cyclomatic complexity: 5378. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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) Result 5850 states and 15306 transitions. Complement of second has 15 states. [2025-04-26 16:22:43,439 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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:22:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2025-04-26 16:22:43,440 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 82 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:43,440 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:43,440 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:43,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:43,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:43,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:43,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:43,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:43,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:43,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:43,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:43,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:43,468 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:43,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:22:43,517 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 5 loop predicates [2025-04-26 16:22:43,517 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3229 states and 8513 transitions. cyclomatic complexity: 5378 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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:22:43,683 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3229 states and 8513 transitions. cyclomatic complexity: 5378. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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) Result 6586 states and 17205 transitions. Complement of second has 14 states. [2025-04-26 16:22:43,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 6 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:22:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2025-04-26 16:22:43,685 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 104 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:43,685 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:43,685 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 104 transitions. Stem has 26 letters. Loop has 8 letters. [2025-04-26 16:22:43,685 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:43,685 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 104 transitions. Stem has 18 letters. Loop has 16 letters. [2025-04-26 16:22:43,685 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:43,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6586 states and 17205 transitions. [2025-04-26 16:22:43,716 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 928 [2025-04-26 16:22:43,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6586 states to 5059 states and 13035 transitions. [2025-04-26 16:22:43,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1504 [2025-04-26 16:22:43,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1652 [2025-04-26 16:22:43,732 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5059 states and 13035 transitions. [2025-04-26 16:22:43,732 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:43,732 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5059 states and 13035 transitions. [2025-04-26 16:22:43,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5059 states and 13035 transitions. [2025-04-26 16:22:43,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5059 to 2907. [2025-04-26 16:22:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2907 states, 2907 states have (on average 2.656346749226006) internal successors, (in total 7722), 2906 states have internal predecessors, (7722), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:43,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 7722 transitions. [2025-04-26 16:22:43,807 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2907 states and 7722 transitions. [2025-04-26 16:22:43,807 INFO L438 stractBuchiCegarLoop]: Abstraction has 2907 states and 7722 transitions. [2025-04-26 16:22:43,807 INFO L340 stractBuchiCegarLoop]: ======== Iteration 57 ============ [2025-04-26 16:22:43,807 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2907 states and 7722 transitions. [2025-04-26 16:22:43,817 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 872 [2025-04-26 16:22:43,817 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:43,817 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:43,818 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:43,818 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:43,818 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:43,818 INFO L754 eck$LassoCheckResult]: Loop: "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:43,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:43,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1014088638, now seen corresponding path program 1 times [2025-04-26 16:22:43,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:43,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452801406] [2025-04-26 16:22:43,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:43,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:43,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:43,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:43,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:43,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:43,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:43,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:43,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:43,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:43,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:43,823 INFO L85 PathProgramCache]: Analyzing trace with hash -498319307, now seen corresponding path program 2 times [2025-04-26 16:22:43,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:43,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060534727] [2025-04-26 16:22:43,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:43,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:43,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:43,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:43,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:43,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:43,826 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:43,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:43,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:43,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:43,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:43,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:43,828 INFO L85 PathProgramCache]: Analyzing trace with hash 239135218, now seen corresponding path program 2 times [2025-04-26 16:22:43,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:43,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241187912] [2025-04-26 16:22:43,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:43,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:43,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-26 16:22:43,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:22:43,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:22:43,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:43,832 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:43,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:22:43,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:22:43,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:43,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:43,981 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:43,982 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:43,982 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:43,982 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:43,982 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:43,982 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:43,982 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:43,982 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:43,982 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration57_Lasso [2025-04-26 16:22:43,982 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:43,982 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:43,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:44,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:44,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:44,127 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:44,127 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:44,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,129 INFO L229 MonitoredProcess]: Starting monitored process 542 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:44,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (542)] Waiting until timeout for monitored process [2025-04-26 16:22:44,130 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:44,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:44,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:44,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:44,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:44,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:44,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:44,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:44,145 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:44,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (542)] Ended with exit code 0 [2025-04-26 16:22:44,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,152 INFO L229 MonitoredProcess]: Starting monitored process 543 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:44,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (543)] Waiting until timeout for monitored process [2025-04-26 16:22:44,154 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:44,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:44,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:44,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:44,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:44,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:44,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:44,167 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:44,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (543)] Ended with exit code 0 [2025-04-26 16:22:44,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,175 INFO L229 MonitoredProcess]: Starting monitored process 544 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:44,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (544)] Waiting until timeout for monitored process [2025-04-26 16:22:44,176 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:44,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:44,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:44,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:44,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:44,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:44,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:44,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:44,188 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:44,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (544)] Ended with exit code 0 [2025-04-26 16:22:44,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,195 INFO L229 MonitoredProcess]: Starting monitored process 545 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:44,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (545)] Waiting until timeout for monitored process [2025-04-26 16:22:44,197 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:44,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:44,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:44,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:44,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:44,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:44,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:44,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:44,208 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:44,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (545)] Ended with exit code 0 [2025-04-26 16:22:44,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,215 INFO L229 MonitoredProcess]: Starting monitored process 546 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:44,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (546)] Waiting until timeout for monitored process [2025-04-26 16:22:44,217 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:44,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:44,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:44,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:44,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:44,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:44,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:44,242 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:44,252 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:22:44,253 INFO L437 ModelExtractionUtils]: 16 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-04-26 16:22:44,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,254 INFO L229 MonitoredProcess]: Starting monitored process 547 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:44,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (547)] Waiting until timeout for monitored process [2025-04-26 16:22:44,256 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:44,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (547)] Ended with exit code 0 [2025-04-26 16:22:44,272 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:22:44,272 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:44,272 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerWithAssertThread1of1ForFork0_i#1) = 1*N - 1*workerWithAssertThread1of1ForFork0_i#1 Supporting invariants [1*cnt + 1*workerThread1of1ForFork1_steal_delta#1 - 1*workerWithAssertThread1of1ForFork0_i#1 - 2 >= 0] [2025-04-26 16:22:44,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (546)] Ended with exit code 0 [2025-04-26 16:22:44,280 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:44,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:44,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:44,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:44,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:44,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:44,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:22:44,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:44,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:44,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:44,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:44,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:44,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 16:22:44,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:44,711 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:44,711 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 9 loop predicates [2025-04-26 16:22:44,711 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2907 states and 7722 transitions. cyclomatic complexity: 4893 Second operand has 15 states, 15 states have (on average 1.8) internal successors, (in total 27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:46,395 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2907 states and 7722 transitions. cyclomatic complexity: 4893. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (in total 27), 14 states have internal predecessors, (27), 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 8631 states and 21669 transitions. Complement of second has 66 states. [2025-04-26 16:22:46,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 37 states 7 stem states 28 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8) internal successors, (in total 27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 277 transitions. [2025-04-26 16:22:46,396 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 37 states and 277 transitions. Stem has 11 letters. Loop has 16 letters. [2025-04-26 16:22:46,396 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:46,396 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 37 states and 277 transitions. Stem has 27 letters. Loop has 16 letters. [2025-04-26 16:22:46,396 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:46,396 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 37 states and 277 transitions. Stem has 11 letters. Loop has 32 letters. [2025-04-26 16:22:46,396 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:46,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8631 states and 21669 transitions. [2025-04-26 16:22:46,438 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1608 [2025-04-26 16:22:46,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8631 states to 7100 states and 18149 transitions. [2025-04-26 16:22:46,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2140 [2025-04-26 16:22:46,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2350 [2025-04-26 16:22:46,470 INFO L74 IsDeterministic]: Start isDeterministic. Operand 7100 states and 18149 transitions. [2025-04-26 16:22:46,470 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:46,470 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7100 states and 18149 transitions. [2025-04-26 16:22:46,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7100 states and 18149 transitions. [2025-04-26 16:22:46,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7100 to 4095. [2025-04-26 16:22:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4095 states, 4095 states have (on average 2.621001221001221) internal successors, (in total 10733), 4094 states have internal predecessors, (10733), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 4095 states and 10733 transitions. [2025-04-26 16:22:46,547 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4095 states and 10733 transitions. [2025-04-26 16:22:46,547 INFO L438 stractBuchiCegarLoop]: Abstraction has 4095 states and 10733 transitions. [2025-04-26 16:22:46,547 INFO L340 stractBuchiCegarLoop]: ======== Iteration 58 ============ [2025-04-26 16:22:46,547 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4095 states and 10733 transitions. [2025-04-26 16:22:46,561 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1418 [2025-04-26 16:22:46,561 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:46,561 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:46,562 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:46,562 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:46,562 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:46,562 INFO L754 eck$LassoCheckResult]: Loop: "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:46,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,562 INFO L85 PathProgramCache]: Analyzing trace with hash -702471130, now seen corresponding path program 2 times [2025-04-26 16:22:46,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747366534] [2025-04-26 16:22:46,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:46,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:46,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:46,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:46,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,564 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:46,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:46,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:46,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,566 INFO L85 PathProgramCache]: Analyzing trace with hash -574376351, now seen corresponding path program 3 times [2025-04-26 16:22:46,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746496449] [2025-04-26 16:22:46,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:46,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:46,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:46,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:46,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,568 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:46,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:46,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:46,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,571 INFO L85 PathProgramCache]: Analyzing trace with hash -576065402, now seen corresponding path program 3 times [2025-04-26 16:22:46,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274971866] [2025-04-26 16:22:46,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:46,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-26 16:22:46,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:22:46,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:22:46,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,575 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:46,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:22:46,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:22:46,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,729 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:46,729 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:46,729 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:46,729 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:46,729 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:46,729 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,730 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:46,730 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:46,730 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration58_Lasso [2025-04-26 16:22:46,730 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:46,730 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:46,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,873 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:46,873 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:46,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,875 INFO L229 MonitoredProcess]: Starting monitored process 548 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:46,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (548)] Waiting until timeout for monitored process [2025-04-26 16:22:46,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:22:46,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,890 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:46,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (548)] Ended with exit code 0 [2025-04-26 16:22:46,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,899 INFO L229 MonitoredProcess]: Starting monitored process 549 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:46,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (549)] Waiting until timeout for monitored process [2025-04-26 16:22:46,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:46,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,914 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:46,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (549)] Ended with exit code 0 [2025-04-26 16:22:46,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,921 INFO L229 MonitoredProcess]: Starting monitored process 550 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:46,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (550)] Waiting until timeout for monitored process [2025-04-26 16:22:46,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:22:46,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,937 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:46,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (550)] Ended with exit code 0 [2025-04-26 16:22:46,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,944 INFO L229 MonitoredProcess]: Starting monitored process 551 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:46,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (551)] Waiting until timeout for monitored process [2025-04-26 16:22:46,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:22:46,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,969 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:46,980 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:22:46,980 INFO L437 ModelExtractionUtils]: 12 out of 25 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:22:46,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,982 INFO L229 MonitoredProcess]: Starting monitored process 552 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:46,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (552)] Waiting until timeout for monitored process [2025-04-26 16:22:46,983 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:46,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (552)] Ended with exit code 0 [2025-04-26 16:22:46,999 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:22:46,999 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:46,999 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerWithAssertThread1of1ForFork0_i#1) = 1*N - 1*workerWithAssertThread1of1ForFork0_i#1 Supporting invariants [1*workerThread1of1ForFork1_steal_delta#1 - 1*workerWithAssertThread1of1ForFork0_i#1 + 1*cnt - 2 >= 0] [2025-04-26 16:22:47,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (551)] Ended with exit code 0 [2025-04-26 16:22:47,007 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:47,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:47,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:47,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:47,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:47,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:47,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:22:47,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:47,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:47,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:47,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:47,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:47,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 16:22:47,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:22:47,388 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 9 loop predicates [2025-04-26 16:22:47,388 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4095 states and 10733 transitions. cyclomatic complexity: 6728 Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (in total 27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:48,304 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4095 states and 10733 transitions. cyclomatic complexity: 6728. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (in total 27), 15 states have internal predecessors, (27), 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 6834 states and 17517 transitions. Complement of second has 42 states. [2025-04-26 16:22:48,304 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 7 stem states 16 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (in total 27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 181 transitions. [2025-04-26 16:22:48,305 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 25 states and 181 transitions. Stem has 11 letters. Loop has 16 letters. [2025-04-26 16:22:48,305 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:48,305 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 25 states and 181 transitions. Stem has 27 letters. Loop has 16 letters. [2025-04-26 16:22:48,305 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:48,305 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 25 states and 181 transitions. Stem has 11 letters. Loop has 32 letters. [2025-04-26 16:22:48,305 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:48,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6834 states and 17517 transitions. [2025-04-26 16:22:48,336 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1732 [2025-04-26 16:22:48,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6834 states to 6240 states and 16164 transitions. [2025-04-26 16:22:48,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1912 [2025-04-26 16:22:48,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2111 [2025-04-26 16:22:48,362 INFO L74 IsDeterministic]: Start isDeterministic. Operand 6240 states and 16164 transitions. [2025-04-26 16:22:48,362 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:48,362 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6240 states and 16164 transitions. [2025-04-26 16:22:48,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6240 states and 16164 transitions. [2025-04-26 16:22:48,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6240 to 4980. [2025-04-26 16:22:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4980 states, 4980 states have (on average 2.616265060240964) internal successors, (in total 13029), 4979 states have internal predecessors, (13029), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4980 states to 4980 states and 13029 transitions. [2025-04-26 16:22:48,432 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4980 states and 13029 transitions. [2025-04-26 16:22:48,432 INFO L438 stractBuchiCegarLoop]: Abstraction has 4980 states and 13029 transitions. [2025-04-26 16:22:48,432 INFO L340 stractBuchiCegarLoop]: ======== Iteration 59 ============ [2025-04-26 16:22:48,432 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4980 states and 13029 transitions. [2025-04-26 16:22:48,446 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1716 [2025-04-26 16:22:48,446 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:48,446 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:48,447 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:48,447 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:48,447 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:48,447 INFO L754 eck$LassoCheckResult]: Loop: "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" [2025-04-26 16:22:48,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:48,448 INFO L85 PathProgramCache]: Analyzing trace with hash -986677270, now seen corresponding path program 3 times [2025-04-26 16:22:48,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:48,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392102058] [2025-04-26 16:22:48,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:48,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:48,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:48,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:48,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:48,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:48,450 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:48,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:48,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:48,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:48,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:48,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:48,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:48,451 INFO L85 PathProgramCache]: Analyzing trace with hash 403039649, now seen corresponding path program 4 times [2025-04-26 16:22:48,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:48,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045492807] [2025-04-26 16:22:48,451 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:48,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:48,453 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-26 16:22:48,454 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:48,454 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:48,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:48,454 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:48,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:48,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:48,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:48,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:48,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:48,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:48,457 INFO L85 PathProgramCache]: Analyzing trace with hash 754152330, now seen corresponding path program 4 times [2025-04-26 16:22:48,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:48,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098002349] [2025-04-26 16:22:48,457 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:48,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:48,459 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-26 16:22:48,460 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:22:48,460 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:48,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:48,460 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:48,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:22:48,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:22:48,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:48,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:48,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:48,593 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:48,593 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:48,593 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:48,593 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:48,593 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:48,593 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:48,593 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:48,593 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:48,593 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration59_Lasso [2025-04-26 16:22:48,593 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:48,593 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:48,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:48,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:48,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:48,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:48,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:48,725 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:48,726 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:48,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:48,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:48,727 INFO L229 MonitoredProcess]: Starting monitored process 553 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:48,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (553)] Waiting until timeout for monitored process [2025-04-26 16:22:48,730 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:48,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:48,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:48,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:48,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:48,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:48,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:48,755 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:48,772 INFO L436 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-04-26 16:22:48,772 INFO L437 ModelExtractionUtils]: 14 out of 25 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:22:48,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:48,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:48,774 INFO L229 MonitoredProcess]: Starting monitored process 554 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:48,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (554)] Waiting until timeout for monitored process [2025-04-26 16:22:48,776 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:48,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (554)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:48,792 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:48,793 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:48,793 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerThread1of1ForFork1_steal_delta#1) = 1*N - 1*cnt - 1*workerThread1of1ForFork1_steal_delta#1 Supporting invariants [] [2025-04-26 16:22:48,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (553)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:48,799 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:48,809 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:48,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:48,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:48,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:48,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:48,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:48,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:48,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:48,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:48,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:48,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:48,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-26 16:22:48,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:49,064 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:49,064 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2025-04-26 16:22:49,064 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4980 states and 13029 transitions. cyclomatic complexity: 8147 Second operand has 10 states, 10 states have (on average 2.7) internal successors, (in total 27), 10 states have internal predecessors, (27), 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:50,014 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4980 states and 13029 transitions. cyclomatic complexity: 8147. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (in total 27), 10 states have internal predecessors, (27), 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 11987 states and 29883 transitions. Complement of second has 37 states. [2025-04-26 16:22:50,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 17 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:50,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.7) internal successors, (in total 27), 10 states have internal predecessors, (27), 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:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 162 transitions. [2025-04-26 16:22:50,015 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 19 states and 162 transitions. Stem has 11 letters. Loop has 16 letters. [2025-04-26 16:22:50,015 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:50,015 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 19 states and 162 transitions. Stem has 27 letters. Loop has 16 letters. [2025-04-26 16:22:50,015 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:50,015 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 19 states and 162 transitions. Stem has 11 letters. Loop has 32 letters. [2025-04-26 16:22:50,016 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:50,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11987 states and 29883 transitions. [2025-04-26 16:22:50,076 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1716 [2025-04-26 16:22:50,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11987 states to 9255 states and 23338 transitions. [2025-04-26 16:22:50,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2399 [2025-04-26 16:22:50,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2641 [2025-04-26 16:22:50,116 INFO L74 IsDeterministic]: Start isDeterministic. Operand 9255 states and 23338 transitions. [2025-04-26 16:22:50,116 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:50,116 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9255 states and 23338 transitions. [2025-04-26 16:22:50,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9255 states and 23338 transitions. [2025-04-26 16:22:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9255 to 6409. [2025-04-26 16:22:50,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6409 states, 6409 states have (on average 2.6038383523170543) internal successors, (in total 16688), 6408 states have internal predecessors, (16688), 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:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6409 states to 6409 states and 16688 transitions. [2025-04-26 16:22:50,222 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6409 states and 16688 transitions. [2025-04-26 16:22:50,222 INFO L438 stractBuchiCegarLoop]: Abstraction has 6409 states and 16688 transitions. [2025-04-26 16:22:50,222 INFO L340 stractBuchiCegarLoop]: ======== Iteration 60 ============ [2025-04-26 16:22:50,222 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6409 states and 16688 transitions. [2025-04-26 16:22:50,263 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1716 [2025-04-26 16:22:50,264 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:50,264 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:50,264 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:50,264 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:50,265 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" [2025-04-26 16:22:50,265 INFO L754 eck$LassoCheckResult]: Loop: "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" [2025-04-26 16:22:50,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:50,265 INFO L85 PathProgramCache]: Analyzing trace with hash -986884780, now seen corresponding path program 4 times [2025-04-26 16:22:50,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:50,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703563528] [2025-04-26 16:22:50,265 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:50,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:50,266 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 11 statements into 2 equivalence classes. [2025-04-26 16:22:50,267 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:50,267 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:50,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:50,267 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:50,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:50,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:50,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:50,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:50,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:50,268 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:50,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1763635227, now seen corresponding path program 5 times [2025-04-26 16:22:50,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:50,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696204959] [2025-04-26 16:22:50,269 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:50,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:50,272 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:50,272 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:50,272 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:50,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:50,273 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:50,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:50,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:50,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:50,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:50,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:50,275 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:50,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1038794898, now seen corresponding path program 5 times [2025-04-26 16:22:50,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:50,275 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055378794] [2025-04-26 16:22:50,275 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:50,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:50,277 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-26 16:22:50,278 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:22:50,278 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:22:50,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:50,278 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:50,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:22:50,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:22:50,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:50,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:50,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:50,423 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:50,424 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:50,424 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:50,424 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:50,424 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:50,424 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:50,424 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:50,424 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:50,424 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration60_Lasso [2025-04-26 16:22:50,424 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:50,424 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:50,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:50,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:50,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:50,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:50,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:50,556 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:50,556 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:50,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:50,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:50,558 INFO L229 MonitoredProcess]: Starting monitored process 555 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:50,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (555)] Waiting until timeout for monitored process [2025-04-26 16:22:50,560 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:50,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:50,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:50,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:50,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:50,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:50,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:50,574 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:50,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (555)] Ended with exit code 0 [2025-04-26 16:22:50,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:50,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:50,582 INFO L229 MonitoredProcess]: Starting monitored process 556 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:50,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (556)] Waiting until timeout for monitored process [2025-04-26 16:22:50,583 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:50,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:50,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:50,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:50,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:50,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:50,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:50,596 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:50,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (556)] Ended with exit code 0 [2025-04-26 16:22:50,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:50,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:50,603 INFO L229 MonitoredProcess]: Starting monitored process 557 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:50,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (557)] Waiting until timeout for monitored process [2025-04-26 16:22:50,605 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:50,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:50,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:50,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:50,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:50,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:50,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:50,617 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:50,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (557)] Ended with exit code 0 [2025-04-26 16:22:50,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:50,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:50,624 INFO L229 MonitoredProcess]: Starting monitored process 558 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:50,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (558)] Waiting until timeout for monitored process [2025-04-26 16:22:50,625 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:50,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:50,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:50,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:50,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:50,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:50,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:50,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:50,637 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:50,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (558)] Ended with exit code 0 [2025-04-26 16:22:50,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:50,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:50,645 INFO L229 MonitoredProcess]: Starting monitored process 559 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:50,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (559)] Waiting until timeout for monitored process [2025-04-26 16:22:50,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:22:50,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:50,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:50,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:50,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:50,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:50,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:50,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:50,657 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:50,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (559)] Ended with exit code 0 [2025-04-26 16:22:50,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:50,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:50,665 INFO L229 MonitoredProcess]: Starting monitored process 560 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:50,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (560)] Waiting until timeout for monitored process [2025-04-26 16:22:50,666 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:50,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:50,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:50,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:50,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:50,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:50,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:50,690 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:50,703 INFO L436 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-04-26 16:22:50,703 INFO L437 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-04-26 16:22:50,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:50,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:50,705 INFO L229 MonitoredProcess]: Starting monitored process 561 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:50,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (561)] Waiting until timeout for monitored process [2025-04-26 16:22:50,706 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:50,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (561)] Ended with exit code 0 [2025-04-26 16:22:50,722 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:50,722 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:50,722 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerThread1of1ForFork1_steal_delta#1, cnt) = 1*N - 1*workerThread1of1ForFork1_steal_delta#1 - 1*cnt Supporting invariants [] [2025-04-26 16:22:50,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (560)] Ended with exit code 0 [2025-04-26 16:22:50,728 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:50,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:50,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:50,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:50,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:50,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:50,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:50,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:50,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:50,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:50,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:50,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:50,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:50,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:50,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:50,868 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-04-26 16:22:50,868 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6409 states and 16688 transitions. cyclomatic complexity: 10401 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (in total 27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:51,007 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6409 states and 16688 transitions. cyclomatic complexity: 10401. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (in total 27), 8 states have internal predecessors, (27), 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 16427 states and 41603 transitions. Complement of second has 19 states. [2025-04-26 16:22:51,007 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (in total 27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2025-04-26 16:22:51,010 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 81 transitions. Stem has 11 letters. Loop has 16 letters. [2025-04-26 16:22:51,010 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:51,010 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 81 transitions. Stem has 27 letters. Loop has 16 letters. [2025-04-26 16:22:51,010 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:51,010 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 81 transitions. Stem has 11 letters. Loop has 32 letters. [2025-04-26 16:22:51,010 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:51,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16427 states and 41603 transitions. [2025-04-26 16:22:51,078 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1716 [2025-04-26 16:22:51,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16427 states to 12871 states and 32655 transitions. [2025-04-26 16:22:51,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2354 [2025-04-26 16:22:51,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2729 [2025-04-26 16:22:51,125 INFO L74 IsDeterministic]: Start isDeterministic. Operand 12871 states and 32655 transitions. [2025-04-26 16:22:51,125 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:51,125 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12871 states and 32655 transitions. [2025-04-26 16:22:51,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12871 states and 32655 transitions. [2025-04-26 16:22:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12871 to 10446. [2025-04-26 16:22:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10446 states, 10446 states have (on average 2.618227072563661) internal successors, (in total 27350), 10445 states have internal predecessors, (27350), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10446 states to 10446 states and 27350 transitions. [2025-04-26 16:22:51,330 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10446 states and 27350 transitions. [2025-04-26 16:22:51,330 INFO L438 stractBuchiCegarLoop]: Abstraction has 10446 states and 27350 transitions. [2025-04-26 16:22:51,331 INFO L340 stractBuchiCegarLoop]: ======== Iteration 61 ============ [2025-04-26 16:22:51,331 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10446 states and 27350 transitions. [2025-04-26 16:22:51,359 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1716 [2025-04-26 16:22:51,359 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:51,359 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:51,359 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:51,359 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:51,360 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" [2025-04-26 16:22:51,360 INFO L754 eck$LassoCheckResult]: Loop: "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" [2025-04-26 16:22:51,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:51,360 INFO L85 PathProgramCache]: Analyzing trace with hash -418391424, now seen corresponding path program 1 times [2025-04-26 16:22:51,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:51,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51052010] [2025-04-26 16:22:51,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:51,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:51,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:51,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:51,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:51,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:51,363 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:51,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:51,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:51,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:51,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:51,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:51,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:51,364 INFO L85 PathProgramCache]: Analyzing trace with hash 372178525, now seen corresponding path program 6 times [2025-04-26 16:22:51,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:51,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122352743] [2025-04-26 16:22:51,364 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:51,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:51,366 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:51,367 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:51,367 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:51,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:51,367 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:51,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:51,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:51,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:51,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:51,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:51,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:51,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1433404708, now seen corresponding path program 6 times [2025-04-26 16:22:51,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:51,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368953037] [2025-04-26 16:22:51,369 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:51,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:51,371 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 2 equivalence classes. [2025-04-26 16:22:51,372 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:22:51,372 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-26 16:22:51,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:51,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:51,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:22:51,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:22:51,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:51,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:51,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:51,574 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:51,574 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:51,574 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:51,574 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:51,574 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:51,574 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:51,574 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:51,574 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:51,574 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration61_Lasso [2025-04-26 16:22:51,574 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:51,574 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:51,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:51,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:51,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:51,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:51,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:51,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:51,913 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:51,913 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:51,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:51,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:51,915 INFO L229 MonitoredProcess]: Starting monitored process 562 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:51,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (562)] Waiting until timeout for monitored process [2025-04-26 16:22:51,917 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:51,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:51,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:51,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:51,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:51,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:51,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:51,929 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:51,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (562)] Ended with exit code 0 [2025-04-26 16:22:51,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:51,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:51,936 INFO L229 MonitoredProcess]: Starting monitored process 563 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:51,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (563)] Waiting until timeout for monitored process [2025-04-26 16:22:51,937 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:51,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:51,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:51,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:51,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:51,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:51,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:51,950 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:51,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (563)] Ended with exit code 0 [2025-04-26 16:22:51,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:51,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:51,957 INFO L229 MonitoredProcess]: Starting monitored process 564 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:51,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (564)] Waiting until timeout for monitored process [2025-04-26 16:22:51,958 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:51,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:51,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:51,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:51,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:51,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:51,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:51,971 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:51,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (564)] Ended with exit code 0 [2025-04-26 16:22:51,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:51,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:51,978 INFO L229 MonitoredProcess]: Starting monitored process 565 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:51,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (565)] Waiting until timeout for monitored process [2025-04-26 16:22:51,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:22:51,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:51,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:51,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:51,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:51,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:51,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:51,992 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:51,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (565)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:51,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:51,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:51,999 INFO L229 MonitoredProcess]: Starting monitored process 566 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:52,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (566)] Waiting until timeout for monitored process [2025-04-26 16:22:52,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:52,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:52,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:52,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:52,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:52,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:52,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:52,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:52,012 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:52,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (566)] Ended with exit code 0 [2025-04-26 16:22:52,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:52,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:52,019 INFO L229 MonitoredProcess]: Starting monitored process 567 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:52,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (567)] Waiting until timeout for monitored process [2025-04-26 16:22:52,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:52,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:52,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:52,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:52,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:52,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:52,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:52,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:52,032 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:52,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (567)] Ended with exit code 0 [2025-04-26 16:22:52,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:52,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:52,040 INFO L229 MonitoredProcess]: Starting monitored process 568 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:52,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (568)] Waiting until timeout for monitored process [2025-04-26 16:22:52,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:52,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:52,051 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:52,051 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:52,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:52,062 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:22:52,063 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:52,094 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:52,129 INFO L436 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-04-26 16:22:52,129 INFO L437 ModelExtractionUtils]: 9 out of 36 variables were initially zero. Simplification set additionally 24 variables to zero. [2025-04-26 16:22:52,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:52,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:52,131 INFO L229 MonitoredProcess]: Starting monitored process 569 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:52,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (569)] Waiting until timeout for monitored process [2025-04-26 16:22:52,132 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:52,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (569)] Ended with exit code 0 [2025-04-26 16:22:52,149 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:22:52,149 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:52,149 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(cnt, N) = -1*cnt + 1*N Supporting invariants [] [2025-04-26 16:22:52,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (568)] Ended with exit code 0 [2025-04-26 16:22:52,156 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:52,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:52,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:52,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:52,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:52,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:52,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:52,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:52,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:52,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:52,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:52,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:52,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:52,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:22:52,327 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-04-26 16:22:52,327 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10446 states and 27350 transitions. cyclomatic complexity: 17096 Second operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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:52,702 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10446 states and 27350 transitions. cyclomatic complexity: 17096. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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 22957 states and 59092 transitions. Complement of second has 17 states. [2025-04-26 16:22:52,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2025-04-26 16:22:52,703 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 95 transitions. Stem has 13 letters. Loop has 16 letters. [2025-04-26 16:22:52,703 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:52,703 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:52,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:52,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:52,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:52,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:52,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:52,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:52,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:52,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:52,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:52,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:52,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:52,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 16:22:52,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:22:52,863 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2025-04-26 16:22:52,864 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10446 states and 27350 transitions. cyclomatic complexity: 17096 Second operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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:53,403 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10446 states and 27350 transitions. cyclomatic complexity: 17096. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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 30443 states and 78075 transitions. Complement of second has 27 states. [2025-04-26 16:22:53,404 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:53,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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:53,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 137 transitions. [2025-04-26 16:22:53,405 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 14 states and 137 transitions. Stem has 13 letters. Loop has 16 letters. [2025-04-26 16:22:53,405 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:53,405 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 14 states and 137 transitions. Stem has 29 letters. Loop has 16 letters. [2025-04-26 16:22:53,405 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:53,405 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 14 states and 137 transitions. Stem has 13 letters. Loop has 32 letters. [2025-04-26 16:22:53,405 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:53,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30443 states and 78075 transitions. [2025-04-26 16:22:53,577 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2614 [2025-04-26 16:22:53,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30443 states to 25532 states and 66247 transitions. [2025-04-26 16:22:53,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4411 [2025-04-26 16:22:53,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4577 [2025-04-26 16:22:53,787 INFO L74 IsDeterministic]: Start isDeterministic. Operand 25532 states and 66247 transitions. [2025-04-26 16:22:53,787 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:53,787 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25532 states and 66247 transitions. [2025-04-26 16:22:53,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25532 states and 66247 transitions. [2025-04-26 16:22:54,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25532 to 18672. [2025-04-26 16:22:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18672 states, 18672 states have (on average 2.651349614395887) internal successors, (in total 49506), 18671 states have internal predecessors, (49506), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:54,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18672 states to 18672 states and 49506 transitions. [2025-04-26 16:22:54,211 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18672 states and 49506 transitions. [2025-04-26 16:22:54,211 INFO L438 stractBuchiCegarLoop]: Abstraction has 18672 states and 49506 transitions. [2025-04-26 16:22:54,211 INFO L340 stractBuchiCegarLoop]: ======== Iteration 62 ============ [2025-04-26 16:22:54,211 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18672 states and 49506 transitions. [2025-04-26 16:22:54,279 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2516 [2025-04-26 16:22:54,279 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:54,279 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:54,279 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:54,279 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:54,280 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:54,280 INFO L754 eck$LassoCheckResult]: Loop: "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:54,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:54,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1633265257, now seen corresponding path program 1 times [2025-04-26 16:22:54,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:54,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22631455] [2025-04-26 16:22:54,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:54,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:54,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:54,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:54,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:54,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:54,283 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:54,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:54,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:54,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:54,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:54,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:54,285 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:54,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1112197209, now seen corresponding path program 7 times [2025-04-26 16:22:54,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:54,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606266210] [2025-04-26 16:22:54,285 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:54,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:54,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:54,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:54,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:54,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:54,291 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:54,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:54,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:54,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:54,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:54,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:54,294 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:54,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1575901891, now seen corresponding path program 7 times [2025-04-26 16:22:54,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:54,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665438635] [2025-04-26 16:22:54,294 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:54,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:54,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:22:54,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:22:54,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:54,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:54,298 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:54,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:22:54,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:22:54,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:54,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:54,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:54,447 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:54,447 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:54,447 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:54,447 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:54,447 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:54,447 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:54,447 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:54,447 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:54,447 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration62_Lasso [2025-04-26 16:22:54,447 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:54,447 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:54,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:54,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:54,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:54,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:54,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:54,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:54,563 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:54,563 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:54,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:54,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:54,565 INFO L229 MonitoredProcess]: Starting monitored process 570 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,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (570)] Waiting until timeout for monitored process [2025-04-26 16:22:54,568 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:54,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:54,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:54,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:54,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:54,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:54,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:54,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:54,581 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:54,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (570)] Ended with exit code 0 [2025-04-26 16:22:54,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:54,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:54,588 INFO L229 MonitoredProcess]: Starting monitored process 571 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,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (571)] Waiting until timeout for monitored process [2025-04-26 16:22:54,590 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:54,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:54,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:54,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:54,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:54,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:54,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:54,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:54,601 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:54,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (571)] Ended with exit code 0 [2025-04-26 16:22:54,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:54,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:54,608 INFO L229 MonitoredProcess]: Starting monitored process 572 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,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (572)] Waiting until timeout for monitored process [2025-04-26 16:22:54,610 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:54,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:54,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:54,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:54,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:54,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:54,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:54,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:54,621 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:54,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (572)] Ended with exit code 0 [2025-04-26 16:22:54,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:54,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:54,628 INFO L229 MonitoredProcess]: Starting monitored process 573 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,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (573)] Waiting until timeout for monitored process [2025-04-26 16:22:54,630 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:54,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:54,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:54,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:54,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:54,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:54,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:54,653 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:54,664 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:22:54,664 INFO L437 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 18 variables to zero. [2025-04-26 16:22:54,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:54,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:54,666 INFO L229 MonitoredProcess]: Starting monitored process 574 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,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (574)] Waiting until timeout for monitored process [2025-04-26 16:22:54,668 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:54,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (574)] Ended with exit code 0 [2025-04-26 16:22:54,684 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:54,684 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:54,684 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2025-04-26 16:22:54,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (573)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:54,691 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:54,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:54,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:54,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:54,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:54,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:54,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:54,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:54,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:54,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:54,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:54,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:54,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:54,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:54,912 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,913 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2025-04-26 16:22:54,913 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18672 states and 49506 transitions. cyclomatic complexity: 31184 Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (in total 33), 9 states have internal predecessors, (33), 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,525 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18672 states and 49506 transitions. cyclomatic complexity: 31184. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (in total 33), 9 states have internal predecessors, (33), 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 53765 states and 139945 transitions. Complement of second has 19 states. [2025-04-26 16:22:55,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (in total 33), 9 states have internal predecessors, (33), 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,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2025-04-26 16:22:55,526 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 104 transitions. Stem has 17 letters. Loop has 16 letters. [2025-04-26 16:22:55,527 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:55,527 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 104 transitions. Stem has 33 letters. Loop has 16 letters. [2025-04-26 16:22:55,527 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:55,527 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 104 transitions. Stem has 17 letters. Loop has 32 letters. [2025-04-26 16:22:55,527 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:55,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53765 states and 139945 transitions. [2025-04-26 16:22:55,922 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2516 [2025-04-26 16:22:56,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53765 states to 42867 states and 111248 transitions. [2025-04-26 16:22:56,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6253 [2025-04-26 16:22:56,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8028 [2025-04-26 16:22:56,321 INFO L74 IsDeterministic]: Start isDeterministic. Operand 42867 states and 111248 transitions. [2025-04-26 16:22:56,322 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:56,322 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42867 states and 111248 transitions. [2025-04-26 16:22:56,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42867 states and 111248 transitions. [2025-04-26 16:22:56,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42867 to 30153. [2025-04-26 16:22:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30153 states, 30153 states have (on average 2.676450104467217) internal successors, (in total 80703), 30152 states have internal predecessors, (80703), 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,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30153 states to 30153 states and 80703 transitions. [2025-04-26 16:22:56,974 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30153 states and 80703 transitions. [2025-04-26 16:22:56,974 INFO L438 stractBuchiCegarLoop]: Abstraction has 30153 states and 80703 transitions. [2025-04-26 16:22:56,974 INFO L340 stractBuchiCegarLoop]: ======== Iteration 63 ============ [2025-04-26 16:22:56,974 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30153 states and 80703 transitions. [2025-04-26 16:22:57,114 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2516 [2025-04-26 16:22:57,115 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:57,115 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:57,115 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:57,115 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:57,120 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" [2025-04-26 16:22:57,120 INFO L754 eck$LassoCheckResult]: Loop: "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" [2025-04-26 16:22:57,120 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:57,120 INFO L85 PathProgramCache]: Analyzing trace with hash -226004368, now seen corresponding path program 2 times [2025-04-26 16:22:57,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:57,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276272211] [2025-04-26 16:22:57,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:57,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:57,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-26 16:22:57,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:22:57,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:22:57,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,124 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:57,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:22:57,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:22:57,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:57,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:57,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1651190017, now seen corresponding path program 8 times [2025-04-26 16:22:57,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:57,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859952513] [2025-04-26 16:22:57,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:57,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:57,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:57,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:57,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:57,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,134 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:57,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:57,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:57,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:57,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:57,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1084197742, now seen corresponding path program 8 times [2025-04-26 16:22:57,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:57,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149433760] [2025-04-26 16:22:57,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:57,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:57,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-26 16:22:57,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-26 16:22:57,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:22:57,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,142 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:57,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-26 16:22:57,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-26 16:22:57,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:57,621 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:57,622 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:57,622 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:57,622 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:57,622 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:57,622 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:57,622 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:57,622 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:57,622 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration63_Lasso [2025-04-26 16:22:57,622 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:57,622 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:57,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,944 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:22:58,230 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:58,230 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:58,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,232 INFO L229 MonitoredProcess]: Starting monitored process 575 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:58,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (575)] Waiting until timeout for monitored process [2025-04-26 16:22:58,234 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:58,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:58,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:58,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:58,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:58,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:58,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:58,247 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (575)] Ended with exit code 0 [2025-04-26 16:22:58,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,256 INFO L229 MonitoredProcess]: Starting monitored process 576 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:58,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (576)] Waiting until timeout for monitored process [2025-04-26 16:22:58,257 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:58,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,267 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:58,267 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:22:58,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:58,295 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2025-04-26 16:22:58,295 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:58,445 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (576)] Ended with exit code 0 [2025-04-26 16:22:58,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,455 INFO L229 MonitoredProcess]: Starting monitored process 577 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:58,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (577)] Waiting until timeout for monitored process [2025-04-26 16:22:58,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:58,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:58,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:58,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:58,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:58,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:58,472 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (577)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:58,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,481 INFO L229 MonitoredProcess]: Starting monitored process 578 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:58,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (578)] Waiting until timeout for monitored process [2025-04-26 16:22:58,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:22:58,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:58,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:58,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:58,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:58,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:58,500 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (578)] Ended with exit code 0 [2025-04-26 16:22:58,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,507 INFO L229 MonitoredProcess]: Starting monitored process 579 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:58,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (579)] Waiting until timeout for monitored process [2025-04-26 16:22:58,509 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:58,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:58,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:58,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:58,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:58,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:58,522 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (579)] Ended with exit code 0 [2025-04-26 16:22:58,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,530 INFO L229 MonitoredProcess]: Starting monitored process 580 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:58,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (580)] Waiting until timeout for monitored process [2025-04-26 16:22:58,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:22:58,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:58,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:58,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:58,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:58,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:58,545 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (580)] Ended with exit code 0 [2025-04-26 16:22:58,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,552 INFO L229 MonitoredProcess]: Starting monitored process 581 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:58,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (581)] Waiting until timeout for monitored process [2025-04-26 16:22:58,554 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:58,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:58,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:58,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:58,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:58,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:58,567 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (581)] Ended with exit code 0 [2025-04-26 16:22:58,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,575 INFO L229 MonitoredProcess]: Starting monitored process 582 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:58,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (582)] Waiting until timeout for monitored process [2025-04-26 16:22:58,576 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:58,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:58,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:58,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:58,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:58,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:58,589 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (582)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:58,594 INFO L453 LassoAnalysis]: Using template '2-nested'. [2025-04-26 16:22:58,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,597 INFO L229 MonitoredProcess]: Starting monitored process 583 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:58,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (583)] Waiting until timeout for monitored process [2025-04-26 16:22:58,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:58,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:58,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:58,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:58,609 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:58,609 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:22:58,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:58,610 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (583)] Ended with exit code 0 [2025-04-26 16:22:58,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,619 INFO L229 MonitoredProcess]: Starting monitored process 584 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:58,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (584)] Waiting until timeout for monitored process [2025-04-26 16:22:58,620 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:58,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,630 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:58,630 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:22:58,630 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:58,661 INFO L402 nArgumentSynthesizer]: We have 54 Motzkin's Theorem applications. [2025-04-26 16:22:58,661 INFO L403 nArgumentSynthesizer]: A total of 9 supporting invariants were added. [2025-04-26 16:22:58,836 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (584)] Ended with exit code 0 [2025-04-26 16:22:58,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,845 INFO L229 MonitoredProcess]: Starting monitored process 585 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:58,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (585)] Waiting until timeout for monitored process [2025-04-26 16:22:58,847 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:58,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:58,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:58,856 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:58,858 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:58,858 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:58,861 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (585)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:58,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,868 INFO L229 MonitoredProcess]: Starting monitored process 586 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:58,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (586)] Waiting until timeout for monitored process [2025-04-26 16:22:58,869 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:58,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:58,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:58,879 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:58,880 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:58,880 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:58,883 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (586)] Ended with exit code 0 [2025-04-26 16:22:58,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,890 INFO L229 MonitoredProcess]: Starting monitored process 587 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:58,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (587)] Waiting until timeout for monitored process [2025-04-26 16:22:58,891 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:58,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:58,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:58,901 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:58,902 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:58,902 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:58,904 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (587)] Ended with exit code 0 [2025-04-26 16:22:58,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,912 INFO L229 MonitoredProcess]: Starting monitored process 588 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:58,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (588)] Waiting until timeout for monitored process [2025-04-26 16:22:58,914 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:58,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:58,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:58,923 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:58,924 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:58,924 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:58,927 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (588)] Ended with exit code 0 [2025-04-26 16:22:58,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,934 INFO L229 MonitoredProcess]: Starting monitored process 589 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:58,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (589)] Waiting until timeout for monitored process [2025-04-26 16:22:58,935 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:58,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:58,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:58,945 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:58,947 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:58,947 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:58,950 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (589)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:58,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,957 INFO L229 MonitoredProcess]: Starting monitored process 590 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:58,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (590)] Waiting until timeout for monitored process [2025-04-26 16:22:58,958 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:58,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:58,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:58,968 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:22:58,969 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:22:58,969 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:22:58,972 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (590)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:58,977 INFO L453 LassoAnalysis]: Using template '3-nested'. [2025-04-26 16:22:58,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,979 INFO L229 MonitoredProcess]: Starting monitored process 591 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:58,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (591)] Waiting until timeout for monitored process [2025-04-26 16:22:58,980 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:58,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:58,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:58,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:58,990 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:58,991 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:22:58,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:58,992 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (591)] Ended with exit code 0 [2025-04-26 16:22:58,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,998 INFO L229 MonitoredProcess]: Starting monitored process 592 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:58,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (592)] Waiting until timeout for monitored process [2025-04-26 16:22:59,000 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,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,010 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:59,010 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:22:59,010 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:59,053 INFO L402 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2025-04-26 16:22:59,053 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2025-04-26 16:22:59,323 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (592)] Ended with exit code 0 [2025-04-26 16:22:59,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,334 INFO L229 MonitoredProcess]: Starting monitored process 593 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,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (593)] Waiting until timeout for monitored process [2025-04-26 16:22:59,335 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,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,346 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:59,347 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:59,347 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:59,352 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (593)] Ended with exit code 0 [2025-04-26 16:22:59,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,359 INFO L229 MonitoredProcess]: Starting monitored process 594 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,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (594)] Waiting until timeout for monitored process [2025-04-26 16:22:59,360 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,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,370 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:59,371 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:59,372 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:59,376 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (594)] Ended with exit code 0 [2025-04-26 16:22:59,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,383 INFO L229 MonitoredProcess]: Starting monitored process 595 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,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (595)] Waiting until timeout for monitored process [2025-04-26 16:22:59,384 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,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,394 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:59,395 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:59,395 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:59,398 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (595)] Ended with exit code 0 [2025-04-26 16:22:59,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,405 INFO L229 MonitoredProcess]: Starting monitored process 596 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,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (596)] Waiting until timeout for monitored process [2025-04-26 16:22:59,455 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,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,465 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:59,467 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:59,467 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:59,470 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (596)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:59,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,477 INFO L229 MonitoredProcess]: Starting monitored process 597 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,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (597)] Waiting until timeout for monitored process [2025-04-26 16:22:59,478 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,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,488 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:22:59,490 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:59,490 INFO L403 nArgumentSynthesizer]: A total of 4 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 L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (597)] Ended with 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,500 INFO L229 MonitoredProcess]: Starting monitored process 598 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,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (598)] 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]: 4 template conjuncts. [2025-04-26 16:22:59,513 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:22:59,513 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:59,517 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (598)] Ended with exit code 0 [2025-04-26 16:22:59,522 INFO L453 LassoAnalysis]: Using template '4-nested'. [2025-04-26 16:22:59,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,524 INFO L229 MonitoredProcess]: Starting monitored process 599 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,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (599)] Waiting until timeout for monitored process [2025-04-26 16:22:59,525 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,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:59,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,536 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:59,536 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:22:59,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:59,538 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (599)] Ended with exit code 0 [2025-04-26 16:22:59,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,545 INFO L229 MonitoredProcess]: Starting monitored process 600 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,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (600)] Waiting until timeout for monitored process [2025-04-26 16:22:59,546 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,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,557 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:59,557 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:22:59,557 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:59,607 INFO L402 nArgumentSynthesizer]: We have 90 Motzkin's Theorem applications. [2025-04-26 16:22:59,608 INFO L403 nArgumentSynthesizer]: A total of 15 supporting invariants were added. [2025-04-26 16:22:59,861 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (600)] Ended with exit code 0 [2025-04-26 16:22:59,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,872 INFO L229 MonitoredProcess]: Starting monitored process 601 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,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (601)] Waiting until timeout for monitored process [2025-04-26 16:22:59,873 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,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,884 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:59,886 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:59,886 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:59,892 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (601)] Ended with exit code 0 [2025-04-26 16:22:59,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,900 INFO L229 MonitoredProcess]: Starting monitored process 602 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,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (602)] Waiting until timeout for monitored process [2025-04-26 16:22:59,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:22:59,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,911 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:59,913 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:59,913 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:59,918 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (602)] Ended with exit code 0 [2025-04-26 16:22:59,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,925 INFO L229 MonitoredProcess]: Starting monitored process 603 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,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (603)] Waiting until timeout for monitored process [2025-04-26 16:22:59,927 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,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,937 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:59,938 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:59,938 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:59,942 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (603)] Ended with exit code 0 [2025-04-26 16:22:59,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,949 INFO L229 MonitoredProcess]: Starting monitored process 604 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,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (604)] Waiting until timeout for monitored process [2025-04-26 16:22:59,951 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,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,960 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:59,962 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:59,962 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:59,966 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (604)] Ended with exit code 0 [2025-04-26 16:22:59,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,973 INFO L229 MonitoredProcess]: Starting monitored process 605 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,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (605)] Waiting until timeout for monitored process [2025-04-26 16:22:59,975 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,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,987 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:22:59,989 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:22:59,989 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:22:59,995 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:00,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (605)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:00,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:00,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:00,002 INFO L229 MonitoredProcess]: Starting monitored process 606 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,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (606)] Waiting until timeout for monitored process [2025-04-26 16:23:00,004 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,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:00,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:00,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:00,016 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:23:00,017 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:23:00,017 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:23:00,022 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:00,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (606)] Ended with exit code 0 [2025-04-26 16:23:00,028 INFO L453 LassoAnalysis]: Using template '2-phase'. [2025-04-26 16:23:00,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:00,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:00,029 INFO L229 MonitoredProcess]: Starting monitored process 607 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,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (607)] Waiting until timeout for monitored process [2025-04-26 16:23:00,031 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,041 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:00,041 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:23:00,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:00,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:00,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:00,041 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:23:00,041 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-04-26 16:23:00,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:00,043 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:00,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (607)] Ended with exit code 0 [2025-04-26 16:23:00,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:00,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:00,050 INFO L229 MonitoredProcess]: Starting monitored process 608 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,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (608)] Waiting until timeout for monitored process [2025-04-26 16:23:00,051 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,061 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:00,062 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:23:00,062 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:23:00,062 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:23:00,062 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:23:00,094 INFO L402 nArgumentSynthesizer]: We have 54 Motzkin's Theorem applications. [2025-04-26 16:23:00,094 INFO L403 nArgumentSynthesizer]: A total of 9 supporting invariants were added. [2025-04-26 16:23:00,861 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 (608)] Ended with exit code 0 [2025-04-26 16:23:00,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:00,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:00,871 INFO L229 MonitoredProcess]: Starting monitored process 609 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,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (609)] Waiting until timeout for monitored process [2025-04-26 16:23:00,873 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,883 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:00,883 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:23:00,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:00,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:00,883 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:23:00,887 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:23:00,887 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:23:00,891 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 (609)] 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,897 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 610 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,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (610)] Waiting until timeout for monitored process [2025-04-26 16:23:00,900 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,910 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:00,910 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:23:00,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:00,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:00,911 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:23:00,912 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:23:00,912 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:23:00,917 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:00,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (610)] Ended with exit code 0 [2025-04-26 16:23:00,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:00,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:00,924 INFO L229 MonitoredProcess]: Starting monitored process 611 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,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (611)] Waiting until timeout for monitored process [2025-04-26 16:23:00,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:00,935 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:00,936 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:23:00,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:00,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:00,936 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:23:00,937 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:23:00,937 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:23:00,940 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:00,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (611)] Ended with exit code 0 [2025-04-26 16:23:00,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:00,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:00,948 INFO L229 MonitoredProcess]: Starting monitored process 612 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,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (612)] Waiting until timeout for monitored process [2025-04-26 16:23:00,949 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,959 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:00,959 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:23:00,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:00,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:00,959 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:23:00,960 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:23:00,960 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:23:00,964 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:00,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (612)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:00,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:00,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:00,971 INFO L229 MonitoredProcess]: Starting monitored process 613 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,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (613)] Waiting until timeout for monitored process [2025-04-26 16:23:00,972 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,983 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:00,983 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:23:00,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:00,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:00,983 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:23:00,984 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:23:00,984 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:23:00,989 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:00,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (613)] Ended with exit code 0 [2025-04-26 16:23:00,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:00,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:00,996 INFO L229 MonitoredProcess]: Starting monitored process 614 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,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (614)] Waiting until timeout for monitored process [2025-04-26 16:23:00,997 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:01,007 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:01,007 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:23:01,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:01,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:01,007 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-04-26 16:23:01,008 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-04-26 16:23:01,008 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-04-26 16:23:01,012 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:01,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (614)] Ended with exit code 0 [2025-04-26 16:23:01,017 INFO L453 LassoAnalysis]: Using template '3-phase'. [2025-04-26 16:23:01,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:01,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:01,019 INFO L229 MonitoredProcess]: Starting monitored process 615 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:01,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (615)] Waiting until timeout for monitored process [2025-04-26 16:23:01,020 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:01,030 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:01,030 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:23:01,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:01,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:01,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:01,031 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:23:01,031 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:23:01,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:01,033 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:01,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (615)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:01,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:01,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:01,041 INFO L229 MonitoredProcess]: Starting monitored process 616 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:01,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (616)] Waiting until timeout for monitored process [2025-04-26 16:23:01,042 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:01,053 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:01,053 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:23:01,053 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:23:01,053 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:23:01,053 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:23:01,096 INFO L402 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2025-04-26 16:23:01,097 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2025-04-26 16:23:01,375 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:01,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (616)] Ended with exit code 0 [2025-04-26 16:23:01,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:01,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:01,386 INFO L229 MonitoredProcess]: Starting monitored process 617 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:01,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (617)] Waiting until timeout for monitored process [2025-04-26 16:23:01,387 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:01,397 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:01,397 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:23:01,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:01,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:01,398 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:23:01,399 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:23:01,399 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:01,406 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:01,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (617)] Ended with exit code 0 [2025-04-26 16:23:01,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:01,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:01,413 INFO L229 MonitoredProcess]: Starting monitored process 618 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:01,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (618)] Waiting until timeout for monitored process [2025-04-26 16:23:01,415 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:01,426 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:01,426 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:23:01,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:01,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:01,426 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:23:01,428 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:23:01,428 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:01,434 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:01,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (618)] Ended with exit code 0 [2025-04-26 16:23:01,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:01,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:01,442 INFO L229 MonitoredProcess]: Starting monitored process 619 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:01,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (619)] Waiting until timeout for monitored process [2025-04-26 16:23:01,444 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:01,454 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:01,454 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:23:01,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:01,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:01,454 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:23:01,455 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:23:01,455 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:01,460 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:01,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (619)] Ended with exit code 0 [2025-04-26 16:23:01,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:01,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:01,468 INFO L229 MonitoredProcess]: Starting monitored process 620 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:01,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (620)] Waiting until timeout for monitored process [2025-04-26 16:23:01,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:01,480 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:01,480 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:23:01,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:01,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:01,480 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:23:01,481 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:23:01,481 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:01,486 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:01,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (620)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:01,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:01,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:01,494 INFO L229 MonitoredProcess]: Starting monitored process 621 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:01,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (621)] Waiting until timeout for monitored process [2025-04-26 16:23:01,495 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:01,506 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:01,506 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:23:01,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:01,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:01,506 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:23:01,508 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:23:01,508 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:01,515 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:01,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (621)] Ended with exit code 0 [2025-04-26 16:23:01,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:01,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:01,522 INFO L229 MonitoredProcess]: Starting monitored process 622 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:01,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (622)] Waiting until timeout for monitored process [2025-04-26 16:23:01,524 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:01,534 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:01,534 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-04-26 16:23:01,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:01,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:01,534 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:23:01,535 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-04-26 16:23:01,535 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:01,541 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:01,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (622)] Ended with exit code 0 [2025-04-26 16:23:01,547 INFO L453 LassoAnalysis]: Using template '4-phase'. [2025-04-26 16:23:01,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:01,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:01,549 INFO L229 MonitoredProcess]: Starting monitored process 623 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:01,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (623)] Waiting until timeout for monitored process [2025-04-26 16:23:01,550 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:01,562 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:01,562 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:23:01,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:01,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:01,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:01,563 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:23:01,564 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-04-26 16:23:01,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:01,567 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:01,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (623)] Ended with exit code 0 [2025-04-26 16:23:01,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:01,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:01,575 INFO L229 MonitoredProcess]: Starting monitored process 624 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:01,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (624)] Waiting until timeout for monitored process [2025-04-26 16:23:01,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:01,587 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:01,588 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:23:01,588 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:23:01,588 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:23:01,588 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:23:01,643 INFO L402 nArgumentSynthesizer]: We have 90 Motzkin's Theorem applications. [2025-04-26 16:23:01,644 INFO L403 nArgumentSynthesizer]: A total of 15 supporting invariants were added. [2025-04-26 16:23:02,615 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (624)] Ended with exit code 0 [2025-04-26 16:23:02,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,627 INFO L229 MonitoredProcess]: Starting monitored process 625 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,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (625)] Waiting until timeout for monitored process [2025-04-26 16:23:02,628 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,639 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:02,639 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:23:02,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,639 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:23:02,641 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:23:02,641 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:23:02,650 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (625)] Ended with exit code 0 [2025-04-26 16:23:02,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,658 INFO L229 MonitoredProcess]: Starting monitored process 626 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,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (626)] Waiting until timeout for monitored process [2025-04-26 16:23:02,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:02,669 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:02,670 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:23:02,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,670 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:23:02,672 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:23:02,672 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:23:02,680 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (626)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:02,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,690 INFO L229 MonitoredProcess]: Starting monitored process 627 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,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (627)] Waiting until timeout for monitored process [2025-04-26 16:23:02,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:02,703 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:02,703 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:23:02,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,703 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:23:02,705 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:23:02,705 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:23:02,711 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (627)] Ended with exit code 0 [2025-04-26 16:23:02,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,719 INFO L229 MonitoredProcess]: Starting monitored process 628 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,737 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,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (628)] Waiting until timeout for monitored process [2025-04-26 16:23:02,749 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:02,749 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:23:02,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,749 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:23:02,751 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:23:02,751 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:23:02,759 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (628)] Ended with exit code 0 [2025-04-26 16:23:02,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,768 INFO L229 MonitoredProcess]: Starting monitored process 629 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,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (629)] Waiting until timeout for monitored process [2025-04-26 16:23:02,770 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,780 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:02,780 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:23:02,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,780 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:23:02,782 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:23:02,783 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:23:02,792 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (629)] Ended with exit code 0 [2025-04-26 16:23:02,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,800 INFO L229 MonitoredProcess]: Starting monitored process 630 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,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (630)] Waiting until timeout for monitored process [2025-04-26 16:23:02,801 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,811 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:02,811 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-04-26 16:23:02,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,811 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-04-26 16:23:02,813 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-04-26 16:23:02,813 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-04-26 16:23:02,820 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (630)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:02,825 INFO L453 LassoAnalysis]: Using template '2-lex'. [2025-04-26 16:23:02,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,827 INFO L229 MonitoredProcess]: Starting monitored process 631 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,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (631)] Waiting until timeout for monitored process [2025-04-26 16:23:02,829 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,839 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:02,839 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:23:02,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:02,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,839 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:23:02,839 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:23:02,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:02,841 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (631)] Ended with exit code 0 [2025-04-26 16:23:02,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,848 INFO L229 MonitoredProcess]: Starting monitored process 632 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,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (632)] Waiting until timeout for monitored process [2025-04-26 16:23:02,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:02,860 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-04-26 16:23:02,860 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-04-26 16:23:02,860 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:23:02,860 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:23:02,860 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-04-26 16:23:02,903 INFO L402 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2025-04-26 16:23:02,903 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2025-04-26 16:23:03,721 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:03,980 INFO L436 ModelExtractionUtils]: Simplification made 31 calls to the SMT solver. [2025-04-26 16:23:03,981 INFO L437 ModelExtractionUtils]: 57 out of 100 variables were initially zero. Simplification set additionally 35 variables to zero. [2025-04-26 16:23:03,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:03,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:03,982 INFO L229 MonitoredProcess]: Starting monitored process 633 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:03,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (633)] Waiting until timeout for monitored process [2025-04-26 16:23:03,984 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:04,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (633)] Ended with exit code 0 [2025-04-26 16:23:04,007 INFO L439 nArgumentSynthesizer]: Removed 11 redundant supporting invariants from a total of 12. [2025-04-26 16:23:04,007 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:04,007 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function 2-lexicographic ranking function: f(cnt, N, workerThread1of1ForFork1_i#1) = Supporting invariants [4*N - 3*cnt >= 0] [2025-04-26 16:23:04,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (632)] Ended with exit code 0 [2025-04-26 16:23:04,023 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:23:04,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:04,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:04,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:04,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:04,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:04,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:04,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:04,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:04,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:04,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-26 16:23:04,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:04,321 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:04,322 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2025-04-26 16:23:04,322 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30153 states and 80703 transitions. cyclomatic complexity: 51260 Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (in total 32), 9 states have internal predecessors, (32), 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,927 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30153 states and 80703 transitions. cyclomatic complexity: 51260. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (in total 32), 9 states have internal predecessors, (32), 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 58284 states and 151764 transitions. Complement of second has 19 states. [2025-04-26 16:23:04,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:04,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (in total 32), 9 states have internal predecessors, (32), 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,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2025-04-26 16:23:04,928 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 91 transitions. Stem has 19 letters. Loop has 16 letters. [2025-04-26 16:23:04,928 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:04,928 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 91 transitions. Stem has 35 letters. Loop has 16 letters. [2025-04-26 16:23:04,928 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:04,928 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 91 transitions. Stem has 19 letters. Loop has 32 letters. [2025-04-26 16:23:04,928 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:04,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58284 states and 151764 transitions. [2025-04-26 16:23:05,445 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2516 [2025-04-26 16:23:05,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58284 states to 47818 states and 125434 transitions. [2025-04-26 16:23:05,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7228 [2025-04-26 16:23:05,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8910 [2025-04-26 16:23:05,689 INFO L74 IsDeterministic]: Start isDeterministic. Operand 47818 states and 125434 transitions. [2025-04-26 16:23:05,690 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:05,690 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47818 states and 125434 transitions. [2025-04-26 16:23:05,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47818 states and 125434 transitions. [2025-04-26 16:23:06,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47818 to 37380. [2025-04-26 16:23:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37380 states, 37380 states have (on average 2.6744515783841627) internal successors, (in total 99971), 37379 states have internal predecessors, (99971), 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,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37380 states to 37380 states and 99971 transitions. [2025-04-26 16:23:06,455 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37380 states and 99971 transitions. [2025-04-26 16:23:06,455 INFO L438 stractBuchiCegarLoop]: Abstraction has 37380 states and 99971 transitions. [2025-04-26 16:23:06,455 INFO L340 stractBuchiCegarLoop]: ======== Iteration 64 ============ [2025-04-26 16:23:06,455 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37380 states and 99971 transitions. [2025-04-26 16:23:06,710 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2516 [2025-04-26 16:23:06,711 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:06,711 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:06,711 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:06,711 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:06,716 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" [2025-04-26 16:23:06,717 INFO L754 eck$LassoCheckResult]: Loop: "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" [2025-04-26 16:23:06,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:06,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1968110224, now seen corresponding path program 1 times [2025-04-26 16:23:06,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:06,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751092578] [2025-04-26 16:23:06,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:06,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:06,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:06,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:06,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:06,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:06,723 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:06,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:06,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:06,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:06,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:06,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:06,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:06,732 INFO L85 PathProgramCache]: Analyzing trace with hash 279507067, now seen corresponding path program 9 times [2025-04-26 16:23:06,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:06,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531592773] [2025-04-26 16:23:06,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:06,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:06,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:06,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:06,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:06,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:06,743 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:06,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:06,744 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,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:06,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:06,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:06,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:06,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1683437546, now seen corresponding path program 9 times [2025-04-26 16:23:06,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:06,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228306514] [2025-04-26 16:23:06,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:06,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:06,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-04-26 16:23:06,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-26 16:23:06,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:23:06,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:06,753 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:06,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-26 16:23:06,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-26 16:23:06,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:06,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:06,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:06,983 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:06,983 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:06,983 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:06,983 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:06,983 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:06,983 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:06,984 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:06,984 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:06,984 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration64_Lasso [2025-04-26 16:23:06,984 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:06,984 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:06,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:07,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:07,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:07,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:07,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:07,178 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:07,178 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:07,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:07,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:07,180 INFO L229 MonitoredProcess]: Starting monitored process 634 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:07,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (634)] Waiting until timeout for monitored process [2025-04-26 16:23:07,182 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:07,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:07,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:07,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:07,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:07,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:07,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:07,196 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:07,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (634)] Ended with exit code 0 [2025-04-26 16:23:07,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:07,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:07,203 INFO L229 MonitoredProcess]: Starting monitored process 635 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:07,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (635)] Waiting until timeout for monitored process [2025-04-26 16:23:07,205 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:07,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:07,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:07,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:07,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:07,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:07,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:07,230 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:07,256 INFO L436 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2025-04-26 16:23:07,256 INFO L437 ModelExtractionUtils]: 1 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. [2025-04-26 16:23:07,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:07,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:07,258 INFO L229 MonitoredProcess]: Starting monitored process 636 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:07,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (636)] Waiting until timeout for monitored process [2025-04-26 16:23:07,259 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:07,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (636)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:07,275 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:07,276 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:07,276 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerThread1of1ForFork1_steal_delta#1, cnt) = 1*N - 1*workerThread1of1ForFork1_steal_delta#1 - 1*cnt Supporting invariants [] [2025-04-26 16:23:07,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (635)] Ended with exit code 0 [2025-04-26 16:23:07,282 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:07,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:07,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:07,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:07,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:07,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:07,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:07,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:07,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:07,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:07,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:07,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:07,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-26 16:23:07,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:07,472 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2025-04-26 16:23:07,472 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37380 states and 99971 transitions. cyclomatic complexity: 63455 Second operand has 10 states, 10 states have (on average 3.5) internal successors, (in total 35), 10 states have internal predecessors, (35), 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,231 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37380 states and 99971 transitions. cyclomatic complexity: 63455. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (in total 35), 10 states have internal predecessors, (35), 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 62271 states and 161713 transitions. Complement of second has 25 states. [2025-04-26 16:23:08,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:08,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (in total 35), 10 states have internal predecessors, (35), 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,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 104 transitions. [2025-04-26 16:23:08,232 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 104 transitions. Stem has 19 letters. Loop has 16 letters. [2025-04-26 16:23:08,232 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:08,232 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:08,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:08,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:08,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:08,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:08,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:08,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:08,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:08,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:08,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:08,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:23:08,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:08,456 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,456 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 16:23:08,456 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37380 states and 99971 transitions. cyclomatic complexity: 63455 Second operand has 7 states, 7 states have (on average 5.0) internal successors, (in total 35), 7 states have internal predecessors, (35), 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,948 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37380 states and 99971 transitions. cyclomatic complexity: 63455. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (in total 35), 7 states have internal predecessors, (35), 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 58721 states and 153190 transitions. Complement of second has 13 states. [2025-04-26 16:23:08,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.0) internal successors, (in total 35), 7 states have internal predecessors, (35), 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,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2025-04-26 16:23:08,949 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 71 transitions. Stem has 19 letters. Loop has 16 letters. [2025-04-26 16:23:08,949 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:08,949 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:08,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:08,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:08,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:08,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:08,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:08,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:08,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:08,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:08,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:08,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-26 16:23:08,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:09,205 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 8 loop predicates [2025-04-26 16:23:09,205 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37380 states and 99971 transitions. cyclomatic complexity: 63455 Second operand has 10 states, 10 states have (on average 3.5) internal successors, (in total 35), 10 states have internal predecessors, (35), 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,244 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37380 states and 99971 transitions. cyclomatic complexity: 63455. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (in total 35), 10 states have internal predecessors, (35), 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 92164 states and 239650 transitions. Complement of second has 24 states. [2025-04-26 16:23:10,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (in total 35), 10 states have internal predecessors, (35), 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,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2025-04-26 16:23:10,245 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 112 transitions. Stem has 19 letters. Loop has 16 letters. [2025-04-26 16:23:10,245 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:10,245 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 112 transitions. Stem has 35 letters. Loop has 16 letters. [2025-04-26 16:23:10,245 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:10,245 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 112 transitions. Stem has 19 letters. Loop has 32 letters. [2025-04-26 16:23:10,245 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:10,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92164 states and 239650 transitions. [2025-04-26 16:23:10,842 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 6170 [2025-04-26 16:23:11,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92164 states to 72588 states and 188561 transitions. [2025-04-26 16:23:11,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8696 [2025-04-26 16:23:11,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11974 [2025-04-26 16:23:11,500 INFO L74 IsDeterministic]: Start isDeterministic. Operand 72588 states and 188561 transitions. [2025-04-26 16:23:11,500 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:11,500 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72588 states and 188561 transitions. [2025-04-26 16:23:11,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72588 states and 188561 transitions. [2025-04-26 16:23:12,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72588 to 50003. [2025-04-26 16:23:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50003 states, 50003 states have (on average 2.7010179389236644) internal successors, (in total 135059), 50002 states have internal predecessors, (135059), 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,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50003 states to 50003 states and 135059 transitions. [2025-04-26 16:23:12,610 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50003 states and 135059 transitions. [2025-04-26 16:23:12,610 INFO L438 stractBuchiCegarLoop]: Abstraction has 50003 states and 135059 transitions. [2025-04-26 16:23:12,610 INFO L340 stractBuchiCegarLoop]: ======== Iteration 65 ============ [2025-04-26 16:23:12,610 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50003 states and 135059 transitions. [2025-04-26 16:23:12,814 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4622 [2025-04-26 16:23:12,814 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:12,814 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:12,815 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:12,815 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:12,816 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" [2025-04-26 16:23:12,816 INFO L754 eck$LassoCheckResult]: Loop: "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" [2025-04-26 16:23:12,816 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:12,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1531642768, now seen corresponding path program 2 times [2025-04-26 16:23:12,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:12,816 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189721520] [2025-04-26 16:23:12,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:12,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:12,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:12,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:12,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:12,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:12,822 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:12,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:12,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:12,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:12,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:12,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:12,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:12,824 INFO L85 PathProgramCache]: Analyzing trace with hash 227154427, now seen corresponding path program 10 times [2025-04-26 16:23:12,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:12,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4254233] [2025-04-26 16:23:12,824 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:12,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:12,826 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-26 16:23:12,827 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:12,827 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:12,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:12,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:12,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:12,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:12,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:12,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:12,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:12,829 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:12,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2136088458, now seen corresponding path program 10 times [2025-04-26 16:23:12,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:12,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891628523] [2025-04-26 16:23:12,829 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:12,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:12,831 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-26 16:23:12,833 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-26 16:23:12,833 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:12,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:12,833 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:12,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-26 16:23:12,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-26 16:23:12,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:12,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:12,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:13,036 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:13,036 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:13,036 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:13,036 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:13,037 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:13,037 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:13,037 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:13,037 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:13,037 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration65_Lasso [2025-04-26 16:23:13,037 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:13,037 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:13,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:13,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:13,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:13,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:13,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:13,231 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:13,231 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:13,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:13,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:13,234 INFO L229 MonitoredProcess]: Starting monitored process 637 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,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (637)] Waiting until timeout for monitored process [2025-04-26 16:23:13,236 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,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:13,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:13,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:13,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:13,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:13,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:13,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:13,248 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:13,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (637)] Ended with exit code 0 [2025-04-26 16:23:13,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:13,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:13,254 INFO L229 MonitoredProcess]: Starting monitored process 638 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,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (638)] Waiting until timeout for monitored process [2025-04-26 16:23:13,256 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,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:13,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:13,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:13,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:13,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:13,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:13,269 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:13,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (638)] Ended with exit code 0 [2025-04-26 16:23:13,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:13,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:13,276 INFO L229 MonitoredProcess]: Starting monitored process 639 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,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (639)] Waiting until timeout for monitored process [2025-04-26 16:23:13,278 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,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:13,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:13,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:13,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:13,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:13,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:13,301 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:13,317 INFO L436 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-04-26 16:23:13,317 INFO L437 ModelExtractionUtils]: 1 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. [2025-04-26 16:23:13,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:13,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:13,320 INFO L229 MonitoredProcess]: Starting monitored process 640 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,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (640)] Waiting until timeout for monitored process [2025-04-26 16:23:13,321 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:13,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (640)] Ended with exit code 0 [2025-04-26 16:23:13,337 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:13,337 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:13,337 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerThread1of1ForFork1_steal_delta#1, cnt) = 1*N - 1*workerThread1of1ForFork1_steal_delta#1 - 1*cnt Supporting invariants [] [2025-04-26 16:23:13,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (639)] Ended with exit code 0 [2025-04-26 16:23:13,343 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:13,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:13,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:13,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:13,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:13,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:13,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:13,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:13,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:13,374 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,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:13,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:13,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:23:13,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:13,671 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,671 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-04-26 16:23:13,672 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50003 states and 135059 transitions. cyclomatic complexity: 86030 Second operand has 8 states, 8 states have (on average 4.375) internal successors, (in total 35), 8 states have internal predecessors, (35), 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,505 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50003 states and 135059 transitions. cyclomatic complexity: 86030. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (in total 35), 8 states have internal predecessors, (35), 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 88872 states and 233644 transitions. Complement of second has 15 states. [2025-04-26 16:23:14,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:14,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (in total 35), 8 states have internal predecessors, (35), 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,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2025-04-26 16:23:14,506 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 78 transitions. Stem has 19 letters. Loop has 16 letters. [2025-04-26 16:23:14,506 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:14,506 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:14,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:14,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:14,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:14,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:14,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:14,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:14,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:14,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:14,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:14,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:14,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:14,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:23:14,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:14,633 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:14,633 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2025-04-26 16:23:14,633 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50003 states and 135059 transitions. cyclomatic complexity: 86030 Second operand has 8 states, 8 states have (on average 4.375) internal successors, (in total 35), 8 states have internal predecessors, (35), 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:15,138 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50003 states and 135059 transitions. cyclomatic complexity: 86030. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (in total 35), 8 states have internal predecessors, (35), 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 88872 states and 233644 transitions. Complement of second has 15 states. [2025-04-26 16:23:15,138 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (in total 35), 8 states have internal predecessors, (35), 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:15,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2025-04-26 16:23:15,138 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 78 transitions. Stem has 19 letters. Loop has 16 letters. [2025-04-26 16:23:15,138 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:15,139 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:15,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:15,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:15,150 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,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:15,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:15,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:15,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:15,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:15,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:15,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:15,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:15,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:23:15,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:15,303 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,304 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 6 loop predicates [2025-04-26 16:23:15,304 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50003 states and 135059 transitions. cyclomatic complexity: 86030 Second operand has 8 states, 8 states have (on average 4.375) internal successors, (in total 35), 8 states have internal predecessors, (35), 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:15,911 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50003 states and 135059 transitions. cyclomatic complexity: 86030. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (in total 35), 8 states have internal predecessors, (35), 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 113819 states and 300377 transitions. Complement of second has 14 states. [2025-04-26 16:23:15,912 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (in total 35), 8 states have internal predecessors, (35), 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:15,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2025-04-26 16:23:15,912 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 86 transitions. Stem has 19 letters. Loop has 16 letters. [2025-04-26 16:23:15,912 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:15,912 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 86 transitions. Stem has 35 letters. Loop has 16 letters. [2025-04-26 16:23:15,912 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:15,912 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 86 transitions. Stem has 19 letters. Loop has 32 letters. [2025-04-26 16:23:15,913 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:15,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113819 states and 300377 transitions. [2025-04-26 16:23:16,897 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 7038 [2025-04-26 16:23:17,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113819 states to 78486 states and 206647 transitions. [2025-04-26 16:23:17,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9328 [2025-04-26 16:23:17,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11882 [2025-04-26 16:23:17,416 INFO L74 IsDeterministic]: Start isDeterministic. Operand 78486 states and 206647 transitions. [2025-04-26 16:23:17,416 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:17,417 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78486 states and 206647 transitions. [2025-04-26 16:23:17,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78486 states and 206647 transitions. [2025-04-26 16:23:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78486 to 54325. [2025-04-26 16:23:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54325 states, 54325 states have (on average 2.7206994937873907) internal successors, (in total 147802), 54324 states have internal predecessors, (147802), 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,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54325 states to 54325 states and 147802 transitions. [2025-04-26 16:23:18,833 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54325 states and 147802 transitions. [2025-04-26 16:23:18,833 INFO L438 stractBuchiCegarLoop]: Abstraction has 54325 states and 147802 transitions. [2025-04-26 16:23:18,833 INFO L340 stractBuchiCegarLoop]: ======== Iteration 66 ============ [2025-04-26 16:23:18,833 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54325 states and 147802 transitions. [2025-04-26 16:23:19,099 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 5282 [2025-04-26 16:23:19,099 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:19,099 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:19,100 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:19,100 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:19,100 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" [2025-04-26 16:23:19,100 INFO L754 eck$LassoCheckResult]: Loop: "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" [2025-04-26 16:23:19,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:19,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1968110224, now seen corresponding path program 3 times [2025-04-26 16:23:19,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:19,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086122184] [2025-04-26 16:23:19,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:19,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:19,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:19,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:19,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:19,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:19,103 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:19,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:19,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:19,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:19,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:19,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:19,106 INFO L85 PathProgramCache]: Analyzing trace with hash 756126139, now seen corresponding path program 11 times [2025-04-26 16:23:19,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:19,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361102721] [2025-04-26 16:23:19,106 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:23:19,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:19,107 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:19,108 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:19,108 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:19,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:19,108 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:19,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:19,109 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,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:19,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:19,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:19,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2134910678, now seen corresponding path program 11 times [2025-04-26 16:23:19,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:19,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934144271] [2025-04-26 16:23:19,110 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:23:19,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:19,112 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-26 16:23:19,115 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-26 16:23:19,115 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:19,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:19,115 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:19,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-26 16:23:19,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-26 16:23:19,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:19,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:19,450 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:19,450 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:19,450 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:19,450 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:19,450 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:19,450 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:19,450 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:19,450 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:19,450 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration66_Lasso [2025-04-26 16:23:19,450 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:19,450 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:19,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:19,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:19,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:19,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:19,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:19,613 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:19,613 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:19,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:19,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:19,615 INFO L229 MonitoredProcess]: Starting monitored process 641 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:19,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (641)] Waiting until timeout for monitored process [2025-04-26 16:23:19,616 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:19,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:19,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:19,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:19,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:19,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:19,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:19,629 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:19,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (641)] Ended with exit code 0 [2025-04-26 16:23:19,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:19,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:19,635 INFO L229 MonitoredProcess]: Starting monitored process 642 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:19,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (642)] Waiting until timeout for monitored process [2025-04-26 16:23:19,637 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:19,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:19,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:19,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:19,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:19,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:19,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:19,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:19,647 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:19,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (642)] Ended with exit code 0 [2025-04-26 16:23:19,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:19,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:19,654 INFO L229 MonitoredProcess]: Starting monitored process 643 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:19,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (643)] Waiting until timeout for monitored process [2025-04-26 16:23:19,655 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:19,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:19,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:19,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:19,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:19,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:19,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:19,679 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:19,699 INFO L436 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2025-04-26 16:23:19,699 INFO L437 ModelExtractionUtils]: 1 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. [2025-04-26 16:23:19,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:19,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:19,701 INFO L229 MonitoredProcess]: Starting monitored process 644 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:19,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (644)] Waiting until timeout for monitored process [2025-04-26 16:23:19,703 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:19,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (644)] Ended with exit code 0 [2025-04-26 16:23:19,718 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:19,718 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:19,718 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(cnt, workerThread1of1ForFork1_steal_delta#1, N) = -1*cnt - 1*workerThread1of1ForFork1_steal_delta#1 + 1*N Supporting invariants [] [2025-04-26 16:23:19,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (643)] Ended with exit code 0 [2025-04-26 16:23:19,724 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:19,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:19,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:19,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:19,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:19,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:19,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:19,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:19,754 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,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:19,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:23:19,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:19,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:19,879 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-04-26 16:23:19,879 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54325 states and 147802 transitions. cyclomatic complexity: 94493 Second operand has 8 states, 8 states have (on average 4.375) internal successors, (in total 35), 8 states have internal predecessors, (35), 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,704 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54325 states and 147802 transitions. cyclomatic complexity: 94493. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (in total 35), 8 states have internal predecessors, (35), 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 118936 states and 310521 transitions. Complement of second has 15 states. [2025-04-26 16:23:20,704 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:20,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (in total 35), 8 states have internal predecessors, (35), 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,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2025-04-26 16:23:20,705 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 81 transitions. Stem has 19 letters. Loop has 16 letters. [2025-04-26 16:23:20,705 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:20,705 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 81 transitions. Stem has 35 letters. Loop has 16 letters. [2025-04-26 16:23:20,705 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:20,705 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 81 transitions. Stem has 19 letters. Loop has 32 letters. [2025-04-26 16:23:20,705 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:20,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118936 states and 310521 transitions. [2025-04-26 16:23:21,695 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 5282 [2025-04-26 16:23:22,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118936 states to 90488 states and 238794 transitions. [2025-04-26 16:23:22,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12009 [2025-04-26 16:23:22,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13239 [2025-04-26 16:23:22,389 INFO L74 IsDeterministic]: Start isDeterministic. Operand 90488 states and 238794 transitions. [2025-04-26 16:23:22,389 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:22,389 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90488 states and 238794 transitions. [2025-04-26 16:23:22,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90488 states and 238794 transitions. [2025-04-26 16:23:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90488 to 64953. [2025-04-26 16:23:23,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64953 states, 64953 states have (on average 2.7030930057118225) internal successors, (in total 175574), 64952 states have internal predecessors, (175574), 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,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64953 states to 64953 states and 175574 transitions. [2025-04-26 16:23:23,866 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64953 states and 175574 transitions. [2025-04-26 16:23:23,866 INFO L438 stractBuchiCegarLoop]: Abstraction has 64953 states and 175574 transitions. [2025-04-26 16:23:23,866 INFO L340 stractBuchiCegarLoop]: ======== Iteration 67 ============ [2025-04-26 16:23:23,866 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64953 states and 175574 transitions. [2025-04-26 16:23:24,331 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 5282 [2025-04-26 16:23:24,332 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:24,332 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:24,332 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:24,332 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:24,333 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" [2025-04-26 16:23:24,333 INFO L754 eck$LassoCheckResult]: Loop: "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" [2025-04-26 16:23:24,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:24,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1904845396, now seen corresponding path program 1 times [2025-04-26 16:23:24,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:24,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139981436] [2025-04-26 16:23:24,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:24,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:24,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:24,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:24,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:24,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:24,336 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:24,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:24,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:24,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:24,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:24,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:24,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:24,338 INFO L85 PathProgramCache]: Analyzing trace with hash 311538133, now seen corresponding path program 12 times [2025-04-26 16:23:24,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:24,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921165171] [2025-04-26 16:23:24,338 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:23:24,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:24,339 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:23:24,341 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:23:24,341 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:23:24,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:24,341 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:24,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:23:24,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:23:24,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:24,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:24,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:24,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:24,344 INFO L85 PathProgramCache]: Analyzing trace with hash -146506112, now seen corresponding path program 12 times [2025-04-26 16:23:24,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:24,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269527941] [2025-04-26 16:23:24,344 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:23:24,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:24,346 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 43 statements into 2 equivalence classes. [2025-04-26 16:23:24,353 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 16:23:24,353 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-26 16:23:24,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:24,353 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:24,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 16:23:24,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 16:23:24,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:24,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:24,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:24,597 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:24,597 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:24,597 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:24,597 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:24,597 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:24,597 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:24,597 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:24,597 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:24,597 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration67_Lasso [2025-04-26 16:23:24,597 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:24,597 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:24,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:24,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:24,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:24,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:24,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:24,804 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:24,804 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:24,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:24,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:24,806 INFO L229 MonitoredProcess]: Starting monitored process 645 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:24,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (645)] Waiting until timeout for monitored process [2025-04-26 16:23:24,807 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:24,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:24,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:24,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:24,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:24,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:24,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:24,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:24,820 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:24,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (645)] Ended with exit code 0 [2025-04-26 16:23:24,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:24,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:24,827 INFO L229 MonitoredProcess]: Starting monitored process 646 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:24,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (646)] Waiting until timeout for monitored process [2025-04-26 16:23:24,829 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:24,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:24,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:24,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:24,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:24,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:24,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:24,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:24,840 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:24,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (646)] Ended with exit code 0 [2025-04-26 16:23:24,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:24,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:24,847 INFO L229 MonitoredProcess]: Starting monitored process 647 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:24,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (647)] Waiting until timeout for monitored process [2025-04-26 16:23:24,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:24,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:24,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:24,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:24,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:24,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:24,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:24,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:24,859 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:24,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (647)] Ended with exit code 0 [2025-04-26 16:23:24,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:24,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:24,867 INFO L229 MonitoredProcess]: Starting monitored process 648 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:24,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (648)] Waiting until timeout for monitored process [2025-04-26 16:23:24,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:24,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:24,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:24,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:24,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:24,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:24,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:24,882 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:24,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (648)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:24,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:24,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:24,889 INFO L229 MonitoredProcess]: Starting monitored process 649 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:24,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (649)] Waiting until timeout for monitored process [2025-04-26 16:23:24,891 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:24,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:24,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:24,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:24,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:24,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:24,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:24,916 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:24,928 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:23:24,928 INFO L437 ModelExtractionUtils]: 1 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. [2025-04-26 16:23:24,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:24,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:24,930 INFO L229 MonitoredProcess]: Starting monitored process 650 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,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (650)] Waiting until timeout for monitored process [2025-04-26 16:23:25,040 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:25,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (650)] Ended with exit code 0 [2025-04-26 16:23:25,056 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:25,056 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:25,056 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerWithAssertThread1of1ForFork0_steal_delta#1, N, cnt) = -1*workerWithAssertThread1of1ForFork0_steal_delta#1 + 1*N - 1*cnt Supporting invariants [] [2025-04-26 16:23:25,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (649)] Ended with exit code 0 [2025-04-26 16:23:25,066 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-04-26 16:23:25,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:25,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:25,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:25,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:25,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:25,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:25,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:25,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:23:25,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:23:25,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:25,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:25,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-26 16:23:25,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:25,512 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 12 loop predicates [2025-04-26 16:23:25,512 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64953 states and 175574 transitions. cyclomatic complexity: 111799 Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (in total 43), 14 states have internal predecessors, (43), 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:27,813 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64953 states and 175574 transitions. cyclomatic complexity: 111799. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (in total 43), 14 states have internal predecessors, (43), 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 97326 states and 255502 transitions. Complement of second has 49 states. [2025-04-26 16:23:27,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 1 stem states 23 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:27,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (in total 43), 14 states have internal predecessors, (43), 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:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 213 transitions. [2025-04-26 16:23:27,814 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 25 states and 213 transitions. Stem has 19 letters. Loop has 24 letters. [2025-04-26 16:23:27,814 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:27,814 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:27,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:27,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:27,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:27,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:27,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:27,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:27,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:23:27,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:23:27,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:27,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-26 16:23:27,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:28,310 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 10 loop predicates [2025-04-26 16:23:28,310 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64953 states and 175574 transitions. cyclomatic complexity: 111799 Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (in total 43), 12 states have internal predecessors, (43), 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,048 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64953 states and 175574 transitions. cyclomatic complexity: 111799. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (in total 43), 12 states have internal predecessors, (43), 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 168963 states and 435365 transitions. Complement of second has 63 states. [2025-04-26 16:23:31,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 32 states 1 stem states 30 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:31,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (in total 43), 12 states have internal predecessors, (43), 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,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 289 transitions. [2025-04-26 16:23:31,049 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 32 states and 289 transitions. Stem has 19 letters. Loop has 24 letters. [2025-04-26 16:23:31,049 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:31,049 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:31,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:31,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:31,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:31,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:31,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:31,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:31,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:23:31,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:23:31,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:31,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-26 16:23:31,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:31,542 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 12 loop predicates [2025-04-26 16:23:31,542 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64953 states and 175574 transitions. cyclomatic complexity: 111799 Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (in total 43), 14 states have internal predecessors, (43), 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:33,935 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64953 states and 175574 transitions. cyclomatic complexity: 111799. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (in total 43), 14 states have internal predecessors, (43), 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 181561 states and 460386 transitions. Complement of second has 139 states. [2025-04-26 16:23:33,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 1 stem states 23 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:33,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (in total 43), 14 states have internal predecessors, (43), 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:33,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 221 transitions. [2025-04-26 16:23:33,936 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 25 states and 221 transitions. Stem has 19 letters. Loop has 24 letters. [2025-04-26 16:23:33,936 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:33,936 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 25 states and 221 transitions. Stem has 43 letters. Loop has 24 letters. [2025-04-26 16:23:33,936 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:33,936 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 25 states and 221 transitions. Stem has 19 letters. Loop has 48 letters. [2025-04-26 16:23:33,936 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:33,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181561 states and 460386 transitions. [2025-04-26 16:23:35,818 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 17764 [2025-04-26 16:23:36,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181561 states to 126996 states and 330000 transitions. [2025-04-26 16:23:36,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17104 [2025-04-26 16:23:36,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21182 [2025-04-26 16:23:36,899 INFO L74 IsDeterministic]: Start isDeterministic. Operand 126996 states and 330000 transitions. [2025-04-26 16:23:36,899 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:36,899 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126996 states and 330000 transitions. [2025-04-26 16:23:37,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126996 states and 330000 transitions. [2025-04-26 16:23:38,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126996 to 78495. [2025-04-26 16:23:38,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78495 states, 78495 states have (on average 2.7245047455251927) internal successors, (in total 213860), 78494 states have internal predecessors, (213860), 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,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78495 states to 78495 states and 213860 transitions. [2025-04-26 16:23:38,865 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78495 states and 213860 transitions. [2025-04-26 16:23:38,865 INFO L438 stractBuchiCegarLoop]: Abstraction has 78495 states and 213860 transitions. [2025-04-26 16:23:38,865 INFO L340 stractBuchiCegarLoop]: ======== Iteration 68 ============ [2025-04-26 16:23:38,865 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78495 states and 213860 transitions. [2025-04-26 16:23:39,489 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 8212 [2025-04-26 16:23:39,489 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:39,489 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:39,490 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:39,490 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2025-04-26 16:23:39,491 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" [2025-04-26 16:23:39,491 INFO L754 eck$LassoCheckResult]: Loop: "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" [2025-04-26 16:23:39,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:39,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1418427474, now seen corresponding path program 3 times [2025-04-26 16:23:39,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:39,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611292411] [2025-04-26 16:23:39,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:39,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:39,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-04-26 16:23:39,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:39,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:23:39,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:39,495 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:39,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:39,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:39,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:39,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:39,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:39,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:39,497 INFO L85 PathProgramCache]: Analyzing trace with hash -725097965, now seen corresponding path program 13 times [2025-04-26 16:23:39,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:39,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986930065] [2025-04-26 16:23:39,497 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:23:39,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:39,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:23:39,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:23:39,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:39,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:39,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:39,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:23:39,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:23:39,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:39,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:39,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:39,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:39,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1918510492, now seen corresponding path program 13 times [2025-04-26 16:23:39,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:39,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365386022] [2025-04-26 16:23:39,507 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:23:39,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:39,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-26 16:23:39,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-26 16:23:39,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:39,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:39,513 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:39,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-26 16:23:39,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-26 16:23:39,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:39,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:39,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:39,884 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:39,884 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:39,885 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:39,885 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:39,885 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:39,885 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,885 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:39,885 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:39,885 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration68_Lasso [2025-04-26 16:23:39,885 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:39,885 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:39,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:40,110 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:40,110 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:40,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:40,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:40,113 INFO L229 MonitoredProcess]: Starting monitored process 651 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:40,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (651)] Waiting until timeout for monitored process [2025-04-26 16:23:40,118 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:40,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:40,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:40,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:40,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:40,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:40,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:40,133 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:40,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (651)] Ended with exit code 0 [2025-04-26 16:23:40,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:40,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:40,140 INFO L229 MonitoredProcess]: Starting monitored process 652 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:40,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (652)] Waiting until timeout for monitored process [2025-04-26 16:23:40,142 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:40,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:40,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:40,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:40,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:40,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:40,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:40,157 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:40,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (652)] Ended with exit code 0 [2025-04-26 16:23:40,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:40,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:40,165 INFO L229 MonitoredProcess]: Starting monitored process 653 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:40,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (653)] Waiting until timeout for monitored process [2025-04-26 16:23:40,167 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:40,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:40,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:40,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:40,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:40,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:40,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:40,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:40,178 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:40,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (653)] Ended with exit code 0 [2025-04-26 16:23:40,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:40,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:40,185 INFO L229 MonitoredProcess]: Starting monitored process 654 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:40,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (654)] Waiting until timeout for monitored process [2025-04-26 16:23:40,187 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:40,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:40,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:40,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:40,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:40,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:40,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:40,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:40,199 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:40,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (654)] Ended with exit code 0 [2025-04-26 16:23:40,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:40,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:40,206 INFO L229 MonitoredProcess]: Starting monitored process 655 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:40,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (655)] Waiting until timeout for monitored process [2025-04-26 16:23:40,208 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:40,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:40,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:40,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:40,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:40,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:40,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:40,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:40,219 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:40,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (655)] Ended with exit code 0 [2025-04-26 16:23:40,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:40,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:40,226 INFO L229 MonitoredProcess]: Starting monitored process 656 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:40,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (656)] Waiting until timeout for monitored process [2025-04-26 16:23:40,228 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:40,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:40,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:40,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:40,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:40,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:40,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:40,254 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:40,274 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:23:40,275 INFO L437 ModelExtractionUtils]: 3 out of 25 variables were initially zero. Simplification set additionally 16 variables to zero. [2025-04-26 16:23:40,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:40,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:40,277 INFO L229 MonitoredProcess]: Starting monitored process 657 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:40,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (657)] Waiting until timeout for monitored process [2025-04-26 16:23:40,278 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:40,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (657)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:40,294 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:23:40,294 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:40,294 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerThread1of1ForFork1_i#1, N) = -1*workerThread1of1ForFork1_i#1 + 1*N Supporting invariants [-1*workerThread1of1ForFork1_i#1 + 1*workerWithAssertThread1of1ForFork0_steal_delta#1 + 1*cnt >= 0] [2025-04-26 16:23:40,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (656)] Ended with exit code 0 [2025-04-26 16:23:40,313 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2025-04-26 16:23:40,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:40,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:40,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:40,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:40,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:40,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-26 16:23:40,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:40,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:23:40,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:23:40,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:40,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:40,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-26 16:23:40,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:41,664 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:41,665 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 16 loop predicates [2025-04-26 16:23:41,665 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78495 states and 213860 transitions. cyclomatic complexity: 136749 Second operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (in total 49), 25 states have internal predecessors, (49), 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:50,126 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78495 states and 213860 transitions. cyclomatic complexity: 136749. Second operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (in total 49), 25 states have internal predecessors, (49), 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 173700 states and 449099 transitions. Complement of second has 132 states. [2025-04-26 16:23:50,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 72 states 11 stem states 59 non-accepting loop states 2 accepting loop states [2025-04-26 16:23:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (in total 49), 25 states have internal predecessors, (49), 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:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 462 transitions. [2025-04-26 16:23:50,127 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 72 states and 462 transitions. Stem has 17 letters. Loop has 32 letters. [2025-04-26 16:23:50,128 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:50,128 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 72 states and 462 transitions. Stem has 49 letters. Loop has 32 letters. [2025-04-26 16:23:50,128 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:50,128 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 72 states and 462 transitions. Stem has 17 letters. Loop has 64 letters. [2025-04-26 16:23:50,128 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:50,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173700 states and 449099 transitions. [2025-04-26 16:23:51,727 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 14826 [2025-04-26 16:23:52,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173700 states to 142655 states and 374840 transitions. [2025-04-26 16:23:52,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18311 [2025-04-26 16:23:52,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18873 [2025-04-26 16:23:52,669 INFO L74 IsDeterministic]: Start isDeterministic. Operand 142655 states and 374840 transitions. [2025-04-26 16:23:52,669 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:52,669 INFO L218 hiAutomatonCegarLoop]: Abstraction has 142655 states and 374840 transitions. [2025-04-26 16:23:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142655 states and 374840 transitions. [2025-04-26 16:23:54,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142655 to 93357. [2025-04-26 16:23:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93357 states, 93357 states have (on average 2.7118373555277056) internal successors, (in total 253169), 93356 states have internal predecessors, (253169), 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:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93357 states to 93357 states and 253169 transitions. [2025-04-26 16:23:55,328 INFO L240 hiAutomatonCegarLoop]: Abstraction has 93357 states and 253169 transitions. [2025-04-26 16:23:55,328 INFO L438 stractBuchiCegarLoop]: Abstraction has 93357 states and 253169 transitions. [2025-04-26 16:23:55,328 INFO L340 stractBuchiCegarLoop]: ======== Iteration 69 ============ [2025-04-26 16:23:55,328 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93357 states and 253169 transitions. [2025-04-26 16:23:55,780 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 12182 [2025-04-26 16:23:55,780 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:55,780 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:55,785 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:55,785 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2025-04-26 16:23:55,786 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" [2025-04-26 16:23:55,786 INFO L754 eck$LassoCheckResult]: Loop: "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" [2025-04-26 16:23:55,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:55,787 INFO L85 PathProgramCache]: Analyzing trace with hash -693935188, now seen corresponding path program 4 times [2025-04-26 16:23:55,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:55,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87122686] [2025-04-26 16:23:55,787 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:55,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:55,788 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-26 16:23:55,789 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:55,789 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:55,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,789 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:55,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:55,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:55,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:55,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:55,791 INFO L85 PathProgramCache]: Analyzing trace with hash 548460609, now seen corresponding path program 14 times [2025-04-26 16:23:55,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:55,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004348340] [2025-04-26 16:23:55,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:55,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:55,793 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-26 16:23:55,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:23:55,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:55,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,796 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:55,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:23:55,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:23:55,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:55,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:55,801 INFO L85 PathProgramCache]: Analyzing trace with hash 673370092, now seen corresponding path program 14 times [2025-04-26 16:23:55,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:55,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162334492] [2025-04-26 16:23:55,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:55,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:55,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-26 16:23:55,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-26 16:23:55,807 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:55,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,807 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:55,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-26 16:23:55,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-26 16:23:55,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:56,204 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:56,204 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:56,204 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:56,204 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:56,204 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:56,204 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,204 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:56,204 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:56,205 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration69_Lasso [2025-04-26 16:23:56,205 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:56,205 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:56,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:56,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:56,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:56,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:56,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:57,109 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:57,109 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:57,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:57,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:57,111 INFO L229 MonitoredProcess]: Starting monitored process 658 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:57,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (658)] Waiting until timeout for monitored process [2025-04-26 16:23:57,115 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:57,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:57,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:57,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:57,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:57,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:57,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:57,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:57,127 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:57,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (658)] Ended with exit code 0 [2025-04-26 16:23:57,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:57,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:57,135 INFO L229 MonitoredProcess]: Starting monitored process 659 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:57,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (659)] Waiting until timeout for monitored process [2025-04-26 16:23:57,137 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:57,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:57,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:57,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:57,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:57,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:57,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:57,160 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:57,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (659)] Ended with exit code 0 [2025-04-26 16:23:57,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:57,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:57,170 INFO L229 MonitoredProcess]: Starting monitored process 660 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:57,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (660)] Waiting until timeout for monitored process [2025-04-26 16:23:57,174 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:57,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:57,187 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:23:57,187 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:23:57,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:57,204 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:23:57,205 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:57,242 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:57,303 INFO L436 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2025-04-26 16:23:57,303 INFO L437 ModelExtractionUtils]: 1 out of 41 variables were initially zero. Simplification set additionally 36 variables to zero. [2025-04-26 16:23:57,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:57,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:57,308 INFO L229 MonitoredProcess]: Starting monitored process 661 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:57,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (661)] Waiting until timeout for monitored process [2025-04-26 16:23:57,310 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:57,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (661)] Ended with exit code 0 [2025-04-26 16:23:57,332 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:23:57,332 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:57,332 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(cnt, N) = -1*cnt + 1*N Supporting invariants [1*workerWithAssertThread1of1ForFork0_steal_delta#1 >= 0] [2025-04-26 16:23:57,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (660)] Ended with exit code 0 [2025-04-26 16:23:57,359 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-04-26 16:23:57,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:57,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:57,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:57,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:57,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:57,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:23:57,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:57,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:23:57,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:23:57,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:57,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:57,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-26 16:23:57,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:58,264 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 15 loop predicates [2025-04-26 16:23:58,264 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93357 states and 253169 transitions. cyclomatic complexity: 161298 Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (in total 49), 18 states have internal predecessors, (49), 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:24:00,529 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93357 states and 253169 transitions. cyclomatic complexity: 161298. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (in total 49), 18 states have internal predecessors, (49), 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 160493 states and 416354 transitions. Complement of second has 39 states. [2025-04-26 16:24:00,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 2 stem states 17 non-accepting loop states 2 accepting loop states [2025-04-26 16:24:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (in total 49), 18 states have internal predecessors, (49), 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:24:00,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 126 transitions. [2025-04-26 16:24:00,530 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 21 states and 126 transitions. Stem has 17 letters. Loop has 32 letters. [2025-04-26 16:24:00,530 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:00,530 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:24:00,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:00,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:24:00,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:24:00,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:00,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:00,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:24:00,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:00,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:24:00,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:24:00,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:00,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:00,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-26 16:24:00,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:01,099 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:01,099 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 13 loop predicates [2025-04-26 16:24:01,099 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93357 states and 253169 transitions. cyclomatic complexity: 161298 Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (in total 49), 16 states have internal predecessors, (49), 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:24:06,074 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93357 states and 253169 transitions. cyclomatic complexity: 161298. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (in total 49), 16 states have internal predecessors, (49), 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 470823 states and 1241913 transitions. Complement of second has 57 states. [2025-04-26 16:24:06,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 30 states 2 stem states 26 non-accepting loop states 2 accepting loop states [2025-04-26 16:24:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.0625) internal successors, (in total 49), 16 states have internal predecessors, (49), 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:24:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 216 transitions. [2025-04-26 16:24:06,075 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 30 states and 216 transitions. Stem has 17 letters. Loop has 32 letters. [2025-04-26 16:24:06,075 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:06,075 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 30 states and 216 transitions. Stem has 49 letters. Loop has 32 letters. [2025-04-26 16:24:06,075 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:06,075 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 30 states and 216 transitions. Stem has 17 letters. Loop has 64 letters. [2025-04-26 16:24:06,075 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:06,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 470823 states and 1241913 transitions. [2025-04-26 16:24:11,172 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 12182 [2025-04-26 16:24:13,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 470823 states to 303817 states and 808229 transitions. [2025-04-26 16:24:13,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20296 [2025-04-26 16:24:13,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21189 [2025-04-26 16:24:13,571 INFO L74 IsDeterministic]: Start isDeterministic. Operand 303817 states and 808229 transitions. [2025-04-26 16:24:13,571 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:13,571 INFO L218 hiAutomatonCegarLoop]: Abstraction has 303817 states and 808229 transitions. [2025-04-26 16:24:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303817 states and 808229 transitions. [2025-04-26 16:24:18,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303817 to 233250. [2025-04-26 16:24:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233250 states, 233250 states have (on average 2.689084673097535) internal successors, (in total 627229), 233249 states have internal predecessors, (627229), 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:24:20,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233250 states to 233250 states and 627229 transitions. [2025-04-26 16:24:20,016 INFO L240 hiAutomatonCegarLoop]: Abstraction has 233250 states and 627229 transitions. [2025-04-26 16:24:20,016 INFO L438 stractBuchiCegarLoop]: Abstraction has 233250 states and 627229 transitions. [2025-04-26 16:24:20,017 INFO L340 stractBuchiCegarLoop]: ======== Iteration 70 ============ [2025-04-26 16:24:20,017 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233250 states and 627229 transitions. [2025-04-26 16:24:21,248 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 12182 [2025-04-26 16:24:21,249 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:21,249 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:21,253 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:24:21,253 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2025-04-26 16:24:21,254 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L27: Formula: (= v_cnt_6 0) InVars {cnt=v_cnt_6} OutVars{cnt=v_cnt_6} AuxVars[] AssignedVars[]" "[83] L27-->L29: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[125] L29-->L39: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_14|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_8|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_x#1]" "[128] L29-1-->L54: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_12|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_delta#1]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[99] ULTIMATE.startFINAL-->ULTIMATE.startEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:24:21,254 INFO L754 eck$LassoCheckResult]: Loop: "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[118] L55-1-->L56: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[120] L56-->L59: Formula: (<= 0 |v_workerThread1of1ForFork1_i#1_5|) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[]" "[121] L59-->L60: Formula: (and (<= 0 |v_workerThread1of1ForFork1_i#1_7|) (< |v_workerThread1of1ForFork1_i#1_7| v_N_8)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_7|, N=v_N_8} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[122] L60-->L54: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_9| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_9|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_9|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[102] L40-->L68: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_x#1]" "[104] L68-->L68-1: Formula: (let ((.cse0 (+ v_cnt_45 |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|))) (or (and (< v_N_23 .cse0) (= v_cnt_45 v_cnt_44) (= (+ |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| 1) 0)) (and (= v_cnt_44 .cse0) (<= .cse0 v_N_23) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_3| v_cnt_45)))) InVars {cnt=v_cnt_45, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_23, cnt=v_cnt_44, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_x#1]" "[112] L54-->L55: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1]" "[105] L68-1-->L40-1: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_5| |v_workerWithAssertThread1of1ForFork0_i#1_1|) InVars {workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_i#1]" "[114] L55-->L68: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1]" "[116] L68-->L68-1: Formula: (let ((.cse0 (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_37))) (or (and (<= .cse0 v_N_19) (= v_cnt_37 |v_workerThread1of1ForFork1_steal_x#1_3|) (= v_cnt_36 .cse0)) (and (= (+ 1 |v_workerThread1of1ForFork1_steal_x#1_3|) 0) (< v_N_19 .cse0) (= v_cnt_37 v_cnt_36)))) InVars {cnt=v_cnt_37, N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|} OutVars{N=v_N_19, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_36, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1]" "[106] L40-1-->L41: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[108] L41-->L44: Formula: (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[110] L44-->L45: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_9|) (< |v_workerWithAssertThread1of1ForFork0_i#1_9| v_N_4)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_9|, N=v_N_4} AuxVars[] AssignedVars[]" "[111] L45-->L39: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_11|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_11|} AuxVars[] AssignedVars[A]" "[100] L39-->L40: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1]" "[117] L68-1-->L55-1: Formula: (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_5|) InVars {workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_i#1]" [2025-04-26 16:24:21,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:21,254 INFO L85 PathProgramCache]: Analyzing trace with hash -30709349, now seen corresponding path program 1 times [2025-04-26 16:24:21,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:21,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757636398] [2025-04-26 16:24:21,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:21,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:21,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:24:21,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:24:21,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,258 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:21,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:24:21,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:24:21,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:21,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:21,262 INFO L85 PathProgramCache]: Analyzing trace with hash -583996421, now seen corresponding path program 15 times [2025-04-26 16:24:21,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:21,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706913116] [2025-04-26 16:24:21,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:24:21,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:21,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-04-26 16:24:21,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:24:21,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:24:21,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,267 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:21,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:24:21,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:24:21,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:21,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:21,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1623233131, now seen corresponding path program 1 times [2025-04-26 16:24:21,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:21,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791777475] [2025-04-26 16:24:21,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:21,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:21,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:24:21,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:24:21,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,276 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:21,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:24:21,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:24:21,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:21,743 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:21,743 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:21,743 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:21,743 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:21,743 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:21,743 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:21,743 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:21,743 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:21,743 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal1.bpl_petrified1_Iteration70_Lasso [2025-04-26 16:24:21,743 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:21,743 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:21,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:21,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:21,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:21,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:21,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:22,231 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:22,232 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:22,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:22,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:22,233 INFO L229 MonitoredProcess]: Starting monitored process 662 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:24:22,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (662)] Waiting until timeout for monitored process [2025-04-26 16:24:22,237 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:24:22,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:22,247 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:24:22,247 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:24:22,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:22,262 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:24:22,262 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:24:22,301 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:22,360 INFO L436 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2025-04-26 16:24:22,360 INFO L437 ModelExtractionUtils]: 1 out of 41 variables were initially zero. Simplification set additionally 36 variables to zero. [2025-04-26 16:24:22,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:22,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:22,362 INFO L229 MonitoredProcess]: Starting monitored process 663 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:24:22,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (663)] Waiting until timeout for monitored process [2025-04-26 16:24:22,363 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:22,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (663)] Ended with exit code 0 [2025-04-26 16:24:22,379 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:24:22,379 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:22,380 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerWithAssertThread1of1ForFork0_steal_delta#1) = 1*N - 1*cnt - 1*workerWithAssertThread1of1ForFork0_steal_delta#1 Supporting invariants [] [2025-04-26 16:24:22,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (662)] Ended with exit code 0 [2025-04-26 16:24:22,402 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2025-04-26 16:24:22,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:22,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:24:22,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:24:22,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:22,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:22,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:22,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:22,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:24:22,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:24:22,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:22,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:22,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-26 16:24:22,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:22,941 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:22,942 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2025-04-26 16:24:22,942 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 233250 states and 627229 transitions. cyclomatic complexity: 396734 Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (in total 49), 15 states have internal predecessors, (49), 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:24:27,815 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 233250 states and 627229 transitions. cyclomatic complexity: 396734. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (in total 49), 15 states have internal predecessors, (49), 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 737367 states and 1688976 transitions. Complement of second has 21 states. [2025-04-26 16:24:27,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (in total 49), 15 states have internal predecessors, (49), 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:24:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2025-04-26 16:24:27,816 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 11 states and 110 transitions. Stem has 18 letters. Loop has 32 letters. [2025-04-26 16:24:27,816 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:27,816 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:24:27,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:27,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:24:27,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:24:27,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:27,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:27,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:27,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:27,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:24:27,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:24:27,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:27,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:27,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-26 16:24:27,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:28,618 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:28,619 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 15 loop predicates [2025-04-26 16:24:28,619 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 233250 states and 627229 transitions. cyclomatic complexity: 396734 Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (in total 49), 17 states have internal predecessors, (49), 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:24:40,710 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 233250 states and 627229 transitions. cyclomatic complexity: 396734. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (in total 49), 17 states have internal predecessors, (49), 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 981960 states and 2161303 transitions. Complement of second has 139 states. [2025-04-26 16:24:40,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 70 states 1 stem states 68 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (in total 49), 17 states have internal predecessors, (49), 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:24:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 404 transitions. [2025-04-26 16:24:40,711 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 70 states and 404 transitions. Stem has 18 letters. Loop has 32 letters. [2025-04-26 16:24:40,712 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:40,712 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 70 states and 404 transitions. Stem has 50 letters. Loop has 32 letters. [2025-04-26 16:24:40,712 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:40,712 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 70 states and 404 transitions. Stem has 18 letters. Loop has 64 letters. [2025-04-26 16:24:40,712 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:40,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 981960 states and 2161303 transitions.