/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/work-steal2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:54:19,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:54:19,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-09 23:54:19,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:54:19,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:54:19,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:54:19,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:54:19,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:54:19,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:54:19,602 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:54:19,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:54:19,602 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:54:19,603 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:54:19,604 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:54:19,604 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:54:19,604 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:54:19,604 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:54:19,604 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:54:19,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:54:19,605 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:54:19,605 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:54:19,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:54:19,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:54:19,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:54:19,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:54:19,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:54:19,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:54:19,607 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:54:19,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:54:19,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:54:19,608 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:54:19,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:54:19,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:54:19,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:54:19,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:54:19,609 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:54:19,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:54:19,609 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:54:19,609 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2024-02-09 23:54:19,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:54:19,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:54:19,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:54:19,871 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-09 23:54:19,872 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-09 23:54:19,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/work-steal2.bpl [2024-02-09 23:54:19,873 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/work-steal2.bpl' [2024-02-09 23:54:19,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:54:19,893 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-09 23:54:19,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:54:19,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:54:19,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:54:19,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:54:19" (1/1) ... [2024-02-09 23:54:19,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:54:19" (1/1) ... [2024-02-09 23:54:19,984 INFO L138 Inliner]: procedures = 4, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2024-02-09 23:54:19,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:54:19,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:54:19,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:54:19,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:54:19,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:54:19" (1/1) ... [2024-02-09 23:54:19,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:54:19" (1/1) ... [2024-02-09 23:54:19,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:54:19" (1/1) ... [2024-02-09 23:54:19,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:54:19" (1/1) ... [2024-02-09 23:54:19,998 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:54:19" (1/1) ... [2024-02-09 23:54:20,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:54:19" (1/1) ... [2024-02-09 23:54:20,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:54:19" (1/1) ... [2024-02-09 23:54:20,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:54:19" (1/1) ... [2024-02-09 23:54:20,003 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:54:20,004 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:54:20,004 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:54:20,004 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:54:20,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:54:19" (1/1) ... [2024-02-09 23:54:20,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:20,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:20,076 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:20,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-09 23:54:20,132 INFO L124 BoogieDeclarations]: Specification and implementation of procedure workerWithAssert given in one single declaration [2024-02-09 23:54:20,132 INFO L130 BoogieDeclarations]: Found specification of procedure workerWithAssert [2024-02-09 23:54:20,132 INFO L138 BoogieDeclarations]: Found implementation of procedure workerWithAssert [2024-02-09 23:54:20,142 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-09 23:54:20,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:54:20,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:54:20,143 INFO L124 BoogieDeclarations]: Specification and implementation of procedure worker given in one single declaration [2024-02-09 23:54:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2024-02-09 23:54:20,143 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2024-02-09 23:54:20,144 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-09 23:54:20,195 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:54:20,197 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:54:20,339 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:54:20,375 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:54:20,376 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-09 23:54:20,377 INFO L201 PluginConnector]: Adding new model work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:54:20 BoogieIcfgContainer [2024-02-09 23:54:20,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:54:20,378 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:54:20,378 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:54:20,381 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:54:20,382 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:54:20,382 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:54:19" (1/2) ... [2024-02-09 23:54:20,383 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b3836a7 and model type work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:54:20, skipping insertion in model container [2024-02-09 23:54:20,383 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:54:20,383 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:54:20" (2/2) ... [2024-02-09 23:54:20,384 INFO L332 chiAutomizerObserver]: Analyzing ICFG work-steal2.bpl [2024-02-09 23:54:20,428 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-09 23:54:20,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 32 transitions, 72 flow [2024-02-09 23:54:20,461 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-02-09 23:54:20,462 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-09 23:54:20,465 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 45 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. [2024-02-09 23:54:20,465 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 32 transitions, 72 flow [2024-02-09 23:54:20,468 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 62 flow [2024-02-09 23:54:20,472 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:54:20,472 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:54:20,472 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:54:20,472 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:54:20,472 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:54:20,473 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:54:20,473 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:54:20,473 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-09 23:54:20,473 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 places, 28 transitions, 62 flow [2024-02-09 23:54:20,480 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:54:20,480 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2024-02-09 23:54:20,480 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-09 23:54:20,480 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:54:20,482 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:54:20,482 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 places, 28 transitions, 62 flow [2024-02-09 23:54:20,486 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:54:20,486 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2024-02-09 23:54:20,486 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-09 23:54:20,486 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:54:20,490 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [91] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[] 39#[L27]true [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 41#[L29]true [121] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_8|, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_10|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_10|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_sz#1, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] 43#[L29-1, L38]true [2024-02-09 23:54:20,490 INFO L750 eck$LassoCheckResult]: Loop: 43#[L29-1, L38]true [96] L38-->L39: 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] 46#[L39, L29-1]true [98] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] 48#[L67, L29-1]true [100] L67-->L68-1: Formula: (or (and (= |v_workerWithAssertThread1of1ForFork0_steal_num#1_3| 0) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_4| |v_workerWithAssertThread1of1ForFork0_steal_x#1_3|) (= v_cnt_Out_2 v_cnt_In_1) (<= v_N_In_1 v_cnt_In_1)) (and (= (+ |v_workerWithAssertThread1of1ForFork0_steal_num#1_3| v_cnt_In_1) v_cnt_Out_2) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3| v_cnt_In_1) v_N_In_1) |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3| (+ (* (- 1) v_cnt_In_1) v_N_In_1)) |v_workerWithAssertThread1of1ForFork0_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_4| v_cnt_In_1) (< v_cnt_In_1 v_N_In_1))) InVars {workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_In_1, cnt=v_cnt_In_1, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} OutVars{workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_3|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_In_1, cnt=v_cnt_Out_2, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] 50#[L29-1, L68-1]true [101] L68-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_7| |v_workerWithAssertThread1of1ForFork0_i#1_1|) (= |v_workerWithAssertThread1of1ForFork0_steal_num#1_5| |v_workerWithAssertThread1of1ForFork0_sz#1_1|)) InVars {workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_5|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_5|, workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_1|, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_sz#1, workerWithAssertThread1of1ForFork0_i#1] 52#[L39-1, L29-1]true [102] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1] 54#[L40, L29-1]true [104] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork0_sz#1_5|) InVars {workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[] 56#[L29-1, L43]true [106] L43-->L44: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) (< |v_workerWithAssertThread1of1ForFork0_i#1_5| v_N_5)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[] 58#[L44, L29-1]true [107] L44-->L38: Formula: (= v_A_1 (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_7|) 1))) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[A] 43#[L29-1, L38]true [2024-02-09 23:54:20,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:54:20,494 INFO L85 PathProgramCache]: Analyzing trace with hash 119812, now seen corresponding path program 1 times [2024-02-09 23:54:20,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:54:20,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030815077] [2024-02-09 23:54:20,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:54:20,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:54:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:54:20,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:54:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:54:20,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:54:20,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:54:20,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2033960711, now seen corresponding path program 1 times [2024-02-09 23:54:20,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:54:20,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855585762] [2024-02-09 23:54:20,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:54:20,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:54:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:54:20,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:54:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:54:20,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:54:20,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:54:20,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1358358538, now seen corresponding path program 1 times [2024-02-09 23:54:20,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:54:20,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964714285] [2024-02-09 23:54:20,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:54:20,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:54:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:54:20,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:54:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:54:20,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:54:20,861 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:54:20,862 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:54:20,862 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:54:20,862 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:54:20,862 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:54:20,862 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:20,862 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:54:20,862 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:54:20,862 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration1_Lasso [2024-02-09 23:54:20,863 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:54:20,863 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:54:20,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:20,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:20,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:21,094 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:54:21,097 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:54:21,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:21,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:21,118 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:21,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:54:21,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:21,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:54:21,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:54:21,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:21,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:54:21,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:54:21,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-09 23:54:21,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:54:21,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:21,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:21,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:21,175 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:21,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-09 23:54:21,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 [2024-02-09 23:54:21,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:21,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:54:21,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:54:21,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:54:21,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:21,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:54:21,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:54:21,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:54:21,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:21,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:21,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:21,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:21,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:54:21,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:21,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:54:21,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:54:21,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:54:21,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:21,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:54:21,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:54:21,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-09 23:54:21,233 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:54:21,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:21,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:21,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:21,240 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:21,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 [2024-02-09 23:54:21,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:21,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:54:21,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:54:21,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:54:21,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:21,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:54:21,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:54:21,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-09 23:54:21,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:54:21,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:21,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:21,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:21,298 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:21,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:54:21,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:21,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:54:21,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:54:21,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:21,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:54:21,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:54:21,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-09 23:54:21,336 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:54:21,349 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-09 23:54:21,349 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-09 23:54:21,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:21,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:21,362 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:21,367 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:54:21,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-09 23:54:21,386 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:54:21,386 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:54:21,387 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2024-02-09 23:54:21,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:21,411 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:54:21,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:54:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:54:21,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:54:21,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:54:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:54:21,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-09 23:54:21,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:54:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:54:21,731 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-09 23:54:21,734 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:54:22,069 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 637 transitions.8 powerset states6 rank states. The highest rank that occured is 1 [2024-02-09 23:54:22,070 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:54:22,071 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:54:22,086 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:54:22,086 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:54:22,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2024-02-09 23:54:22,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:54:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2024-02-09 23:54:22,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 210 transitions. Stem has 3 letters. Loop has 8 letters. [2024-02-09 23:54:22,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:54:22,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 210 transitions. Stem has 11 letters. Loop has 8 letters. [2024-02-09 23:54:22,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:54:22,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 210 transitions. Stem has 3 letters. Loop has 16 letters. [2024-02-09 23:54:22,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:54:22,112 INFO L428 stractBuchiCegarLoop]: Abstraction has has 59 places, 1106 transitions, 4628 flow [2024-02-09 23:54:22,112 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:54:22,112 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 59 places, 1106 transitions, 4628 flow [2024-02-09 23:54:22,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-02-09 23:54:22,325 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:54:22,325 INFO L124 PetriNetUnfolderBase]: 1145/1737 cut-off events. [2024-02-09 23:54:22,325 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-02-09 23:54:22,325 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:54:22,326 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [91] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[] 39#[L27]true [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 41#[L29]true [121] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_8|, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_10|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_10|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_sz#1, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] 43#[L29-1, L38]true [124] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_sz#1=|v_workerThread1of1ForFork1_sz#1_8|, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_8|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_10|, workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_sz#1, workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_num#1, workerThread1of1ForFork1_steal_delta#1] 162#[L38, L53, ULTIMATE.startFINAL]true [108] L53-->L54: 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] 164#[L54, L38, ULTIMATE.startFINAL]true [110] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_num#1] 166#[L67, L38, ULTIMATE.startFINAL]true [112] L67-->L68-1: Formula: (or (and (< v_cnt_In_3 v_N_In_3) (= (ite (< (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_In_3) v_N_In_3) |v_workerThread1of1ForFork1_steal_delta#1_3| (+ v_N_In_3 (* (- 1) v_cnt_In_3))) |v_workerThread1of1ForFork1_steal_num#1_3|) (= v_cnt_In_3 |v_workerThread1of1ForFork1_steal_x#1_4|) (= (+ |v_workerThread1of1ForFork1_steal_num#1_3| v_cnt_In_3) v_cnt_Out_6)) (and (= v_cnt_Out_6 v_cnt_In_3) (<= v_N_In_3 v_cnt_In_3) (= |v_workerThread1of1ForFork1_steal_x#1_4| |v_workerThread1of1ForFork1_steal_x#1_3|) (= |v_workerThread1of1ForFork1_steal_num#1_3| 0))) InVars {N=v_N_In_3, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_In_3, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} OutVars{workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_3|, N=v_N_In_3, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_Out_6, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_num#1] 168#[L68-1, L38, ULTIMATE.startFINAL]true [2024-02-09 23:54:22,326 INFO L750 eck$LassoCheckResult]: Loop: 168#[L68-1, L38, ULTIMATE.startFINAL]true [113] L68-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork1_sz#1_1| |v_workerThread1of1ForFork1_steal_num#1_5|) (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_7|)) InVars {workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_5|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_7|} OutVars{workerThread1of1ForFork1_sz#1=|v_workerThread1of1ForFork1_sz#1_1|, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_5|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork1_sz#1, workerThread1of1ForFork1_i#1] 171#[L54-1, L38, ULTIMATE.startFINAL]true [114] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1] 173#[L55, L38, ULTIMATE.startFINAL]true [116] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork1_sz#1_5|) InVars {workerThread1of1ForFork1_sz#1=|v_workerThread1of1ForFork1_sz#1_5|} OutVars{workerThread1of1ForFork1_sz#1=|v_workerThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[] 175#[L58, L38, ULTIMATE.startFINAL]true [117] L58-->L59: Formula: (and (< |v_workerThread1of1ForFork1_i#1_3| v_N_10) (<= 0 |v_workerThread1of1ForFork1_i#1_3|)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[] 177#[L38, L59, ULTIMATE.startFINAL]true [118] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[A] 162#[L38, L53, ULTIMATE.startFINAL]true [108] L53-->L54: 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] 164#[L54, L38, ULTIMATE.startFINAL]true [110] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_num#1] 166#[L67, L38, ULTIMATE.startFINAL]true [112] L67-->L68-1: Formula: (or (and (< v_cnt_In_3 v_N_In_3) (= (ite (< (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_In_3) v_N_In_3) |v_workerThread1of1ForFork1_steal_delta#1_3| (+ v_N_In_3 (* (- 1) v_cnt_In_3))) |v_workerThread1of1ForFork1_steal_num#1_3|) (= v_cnt_In_3 |v_workerThread1of1ForFork1_steal_x#1_4|) (= (+ |v_workerThread1of1ForFork1_steal_num#1_3| v_cnt_In_3) v_cnt_Out_6)) (and (= v_cnt_Out_6 v_cnt_In_3) (<= v_N_In_3 v_cnt_In_3) (= |v_workerThread1of1ForFork1_steal_x#1_4| |v_workerThread1of1ForFork1_steal_x#1_3|) (= |v_workerThread1of1ForFork1_steal_num#1_3| 0))) InVars {N=v_N_In_3, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_In_3, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} OutVars{workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_3|, N=v_N_In_3, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_Out_6, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_num#1] 168#[L68-1, L38, ULTIMATE.startFINAL]true [2024-02-09 23:54:22,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:54:22,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1016450250, now seen corresponding path program 1 times [2024-02-09 23:54:22,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:54:22,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321176306] [2024-02-09 23:54:22,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:54:22,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:54:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:54:22,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:54:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:54:22,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:54:22,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:54:22,340 INFO L85 PathProgramCache]: Analyzing trace with hash -909521573, now seen corresponding path program 1 times [2024-02-09 23:54:22,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:54:22,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815999303] [2024-02-09 23:54:22,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:54:22,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:54:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:54:22,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:54:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:54:22,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:54:22,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:54:22,353 INFO L85 PathProgramCache]: Analyzing trace with hash -679740528, now seen corresponding path program 1 times [2024-02-09 23:54:22,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:54:22,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597909537] [2024-02-09 23:54:22,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:54:22,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:54:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:54:22,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:54:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:54:22,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:54:22,583 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:54:22,583 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:54:22,583 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:54:22,584 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:54:22,584 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:54:22,584 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:22,584 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:54:22,584 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:54:22,584 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration2_Lasso [2024-02-09 23:54:22,584 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:54:22,584 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:54:22,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:22,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:22,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:22,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:22,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:22,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:22,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:22,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:22,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:22,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:22,971 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:54:22,971 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:54:22,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:22,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:22,986 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:22,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-09 23:54:22,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:54:23,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:23,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:54:23,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:54:23,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:54:23,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:23,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:54:23,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:54:23,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:54:23,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:23,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:23,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:23,040 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:23,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-09 23:54:23,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:54:23,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:23,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:54:23,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:54:23,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:23,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:54:23,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:54:23,092 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:54:23,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:23,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:23,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:23,100 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:23,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 [2024-02-09 23:54:23,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:23,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:54:23,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:54:23,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:23,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:54:23,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:54:23,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-09 23:54:23,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:54:23,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:23,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:23,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:23,136 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:23,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-09 23:54:23,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 [2024-02-09 23:54:23,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:23,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:54:23,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:54:23,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:54:23,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:23,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:54:23,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:54:23,193 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:54:23,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:23,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:23,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:23,198 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:23,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:54:23,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:23,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:54:23,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:54:23,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:54:23,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:23,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:54:23,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:54:23,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-09 23:54:23,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:54:23,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:23,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:23,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:23,224 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:23,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-09 23:54:23,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:54:23,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:23,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:54:23,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:54:23,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:54:23,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:23,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:54:23,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:54:23,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:54:23,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:23,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:23,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:23,275 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:23,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-09 23:54:23,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 [2024-02-09 23:54:23,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:23,284 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-02-09 23:54:23,284 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:54:23,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:23,315 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2024-02-09 23:54:23,316 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:54:23,343 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:54:23,374 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-02-09 23:54:23,375 INFO L444 ModelExtractionUtils]: 22 out of 36 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-02-09 23:54:23,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:23,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:23,393 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:23,398 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:54:23,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-02-09 23:54:23,425 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:54:23,425 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:54:23,425 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerThread1of1ForFork1_steal_num#1, cnt) = 3*N + 2*workerThread1of1ForFork1_steal_num#1 - 2*cnt Supporting invariants [-2*cnt + 3*N >= 0] [2024-02-09 23:54:23,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:23,436 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:54:23,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:54:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:54:23,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-09 23:54:23,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:54:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:54:23,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:54:23,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:54:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:54:23,586 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 4 loop predicates [2024-02-09 23:54:23,586 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:54:23,963 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 1318 transitions.16 powerset states13 rank states. The highest rank that occured is 1 [2024-02-09 23:54:23,964 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:54:23,964 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:54:24,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:24,489 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:54:24,489 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:54:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 4 stem states 9 non-accepting loop states 2 accepting loop states [2024-02-09 23:54:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:54:24,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 427 transitions. [2024-02-09 23:54:24,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 427 transitions. Stem has 7 letters. Loop has 8 letters. [2024-02-09 23:54:24,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:54:24,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 427 transitions. Stem has 15 letters. Loop has 8 letters. [2024-02-09 23:54:24,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:54:24,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 427 transitions. Stem has 7 letters. Loop has 16 letters. [2024-02-09 23:54:24,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:54:24,506 INFO L428 stractBuchiCegarLoop]: Abstraction has has 117 places, 91888 transitions, 567108 flow [2024-02-09 23:54:24,506 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:54:24,507 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 117 places, 91888 transitions, 567108 flow [2024-02-09 23:54:29,563 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:54:29,563 INFO L124 PetriNetUnfolderBase]: 6564/9149 cut-off events. [2024-02-09 23:54:29,563 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2024-02-09 23:54:29,564 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:54:29,564 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [91] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[] 39#[L27]true [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 41#[L29]true [121] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_8|, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_10|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_10|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_sz#1, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] 43#[L29-1, L38]true [96] L38-->L39: 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] 46#[L39, L29-1]true [98] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] 48#[L67, L29-1]true [100] L67-->L68-1: Formula: (or (and (= |v_workerWithAssertThread1of1ForFork0_steal_num#1_3| 0) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_4| |v_workerWithAssertThread1of1ForFork0_steal_x#1_3|) (= v_cnt_Out_2 v_cnt_In_1) (<= v_N_In_1 v_cnt_In_1)) (and (= (+ |v_workerWithAssertThread1of1ForFork0_steal_num#1_3| v_cnt_In_1) v_cnt_Out_2) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3| v_cnt_In_1) v_N_In_1) |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3| (+ (* (- 1) v_cnt_In_1) v_N_In_1)) |v_workerWithAssertThread1of1ForFork0_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_4| v_cnt_In_1) (< v_cnt_In_1 v_N_In_1))) InVars {workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_In_1, cnt=v_cnt_In_1, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} OutVars{workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_3|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_In_1, cnt=v_cnt_Out_2, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] 50#[L29-1, L68-1]true [124] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_sz#1=|v_workerThread1of1ForFork1_sz#1_8|, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_8|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_10|, workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_sz#1, workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_num#1, workerThread1of1ForFork1_steal_delta#1] 341#[ULTIMATE.startFINAL, L53, L68-1]true [108] L53-->L54: 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] 343#[L54, ULTIMATE.startFINAL, L68-1]true [110] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_num#1] 345#[L67, ULTIMATE.startFINAL, L68-1]true [101] L68-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_7| |v_workerWithAssertThread1of1ForFork0_i#1_1|) (= |v_workerWithAssertThread1of1ForFork0_steal_num#1_5| |v_workerWithAssertThread1of1ForFork0_sz#1_1|)) InVars {workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_5|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_5|, workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_1|, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_sz#1, workerWithAssertThread1of1ForFork0_i#1] 347#[L39-1, L67, ULTIMATE.startFINAL]true [102] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1] 349#[L67, L40, ULTIMATE.startFINAL]true [104] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork0_sz#1_5|) InVars {workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[] 351#[L67, L43, ULTIMATE.startFINAL]true [106] L43-->L44: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) (< |v_workerWithAssertThread1of1ForFork0_i#1_5| v_N_5)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[] 353#[L44, L67, ULTIMATE.startFINAL]true [112] L67-->L68-1: Formula: (or (and (< v_cnt_In_3 v_N_In_3) (= (ite (< (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_In_3) v_N_In_3) |v_workerThread1of1ForFork1_steal_delta#1_3| (+ v_N_In_3 (* (- 1) v_cnt_In_3))) |v_workerThread1of1ForFork1_steal_num#1_3|) (= v_cnt_In_3 |v_workerThread1of1ForFork1_steal_x#1_4|) (= (+ |v_workerThread1of1ForFork1_steal_num#1_3| v_cnt_In_3) v_cnt_Out_6)) (and (= v_cnt_Out_6 v_cnt_In_3) (<= v_N_In_3 v_cnt_In_3) (= |v_workerThread1of1ForFork1_steal_x#1_4| |v_workerThread1of1ForFork1_steal_x#1_3|) (= |v_workerThread1of1ForFork1_steal_num#1_3| 0))) InVars {N=v_N_In_3, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_In_3, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} OutVars{workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_3|, N=v_N_In_3, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_Out_6, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_num#1] 355#[L44, L68-1, ULTIMATE.startFINAL]true [107] L44-->L38: Formula: (= v_A_1 (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_7|) 1))) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[A] 168#[L68-1, L38, ULTIMATE.startFINAL]true [96] L38-->L39: 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] 358#[L39, L68-1, ULTIMATE.startFINAL]true [98] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] 360#[L68-1, L67, ULTIMATE.startFINAL]true [100] L67-->L68-1: Formula: (or (and (= |v_workerWithAssertThread1of1ForFork0_steal_num#1_3| 0) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_4| |v_workerWithAssertThread1of1ForFork0_steal_x#1_3|) (= v_cnt_Out_2 v_cnt_In_1) (<= v_N_In_1 v_cnt_In_1)) (and (= (+ |v_workerWithAssertThread1of1ForFork0_steal_num#1_3| v_cnt_In_1) v_cnt_Out_2) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3| v_cnt_In_1) v_N_In_1) |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3| (+ (* (- 1) v_cnt_In_1) v_N_In_1)) |v_workerWithAssertThread1of1ForFork0_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_4| v_cnt_In_1) (< v_cnt_In_1 v_N_In_1))) InVars {workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_In_1, cnt=v_cnt_In_1, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} OutVars{workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_3|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_In_1, cnt=v_cnt_Out_2, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] 362#[L68-1, ULTIMATE.startFINAL, L68-1]true [2024-02-09 23:54:29,565 INFO L750 eck$LassoCheckResult]: Loop: 362#[L68-1, ULTIMATE.startFINAL, L68-1]true [101] L68-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_7| |v_workerWithAssertThread1of1ForFork0_i#1_1|) (= |v_workerWithAssertThread1of1ForFork0_steal_num#1_5| |v_workerWithAssertThread1of1ForFork0_sz#1_1|)) InVars {workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_5|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_5|, workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_1|, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_sz#1, workerWithAssertThread1of1ForFork0_i#1] 365#[L68-1, L39-1, ULTIMATE.startFINAL]true [102] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1] 367#[L68-1, L40, ULTIMATE.startFINAL]true [104] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork0_sz#1_5|) InVars {workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[] 369#[L68-1, L43, ULTIMATE.startFINAL]true [106] L43-->L44: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) (< |v_workerWithAssertThread1of1ForFork0_i#1_5| v_N_5)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[] 355#[L44, L68-1, ULTIMATE.startFINAL]true [107] L44-->L38: Formula: (= v_A_1 (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_7|) 1))) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[A] 168#[L68-1, L38, ULTIMATE.startFINAL]true [96] L38-->L39: 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] 358#[L39, L68-1, ULTIMATE.startFINAL]true [98] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] 360#[L68-1, L67, ULTIMATE.startFINAL]true [100] L67-->L68-1: Formula: (or (and (= |v_workerWithAssertThread1of1ForFork0_steal_num#1_3| 0) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_4| |v_workerWithAssertThread1of1ForFork0_steal_x#1_3|) (= v_cnt_Out_2 v_cnt_In_1) (<= v_N_In_1 v_cnt_In_1)) (and (= (+ |v_workerWithAssertThread1of1ForFork0_steal_num#1_3| v_cnt_In_1) v_cnt_Out_2) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3| v_cnt_In_1) v_N_In_1) |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3| (+ (* (- 1) v_cnt_In_1) v_N_In_1)) |v_workerWithAssertThread1of1ForFork0_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_4| v_cnt_In_1) (< v_cnt_In_1 v_N_In_1))) InVars {workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_In_1, cnt=v_cnt_In_1, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} OutVars{workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_3|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_In_1, cnt=v_cnt_Out_2, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] 362#[L68-1, ULTIMATE.startFINAL, L68-1]true [2024-02-09 23:54:29,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:54:29,565 INFO L85 PathProgramCache]: Analyzing trace with hash 567584036, now seen corresponding path program 1 times [2024-02-09 23:54:29,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:54:29,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544040145] [2024-02-09 23:54:29,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:54:29,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:54:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:54:29,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:54:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:54:29,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:54:29,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:54:29,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1532400443, now seen corresponding path program 2 times [2024-02-09 23:54:29,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:54:29,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751029509] [2024-02-09 23:54:29,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:54:29,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:54:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:54:29,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:54:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:54:29,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:54:29,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:54:29,599 INFO L85 PathProgramCache]: Analyzing trace with hash -904829602, now seen corresponding path program 2 times [2024-02-09 23:54:29,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:54:29,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587553693] [2024-02-09 23:54:29,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:54:29,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:54:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:54:29,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:54:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:54:29,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:54:30,059 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:54:30,060 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:54:30,060 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:54:30,060 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:54:30,060 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:54:30,060 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:30,060 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:54:30,060 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:54:30,060 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration3_Lasso [2024-02-09 23:54:30,060 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:54:30,060 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:54:30,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:30,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:30,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:30,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:30,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:30,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:30,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:30,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:30,896 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-02-09 23:54:31,282 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:54:31,283 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:54:31,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:31,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:31,287 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:31,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-02-09 23:54:31,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:54:31,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:31,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:54:31,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:54:31,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:54:31,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:31,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:54:31,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:54:31,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:54:31,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:31,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:31,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:31,301 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:31,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:54:31,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:31,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:54:31,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:54:31,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:31,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:54:31,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:54:31,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-02-09 23:54:31,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:54:31,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:31,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:31,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:31,334 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:31,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:54:31,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:31,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:54:31,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:54:31,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:31,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:54:31,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:54:31,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:54:31,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-02-09 23:54:31,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:31,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:31,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:31,357 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:31,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-02-09 23:54:31,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 [2024-02-09 23:54:31,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:31,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:54:31,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:54:31,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:31,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:54:31,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:54:31,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:54:31,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:31,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:31,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:31,375 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:31,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-02-09 23:54:31,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:54:31,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:31,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:54:31,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:54:31,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:31,385 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:54:31,385 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:54:31,400 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:54:31,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:31,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:31,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:31,405 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:31,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:54:31,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:31,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:54:31,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:54:31,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:31,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:54:31,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:54:31,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-02-09 23:54:31,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:54:31,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:31,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:31,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:31,437 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:31,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 [2024-02-09 23:54:31,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:31,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:54:31,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:54:31,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:54:31,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:31,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:54:31,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:54:31,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-02-09 23:54:31,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:54:31,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:31,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:31,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:31,465 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:31,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 [2024-02-09 23:54:31,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:31,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:54:31,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:54:31,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:31,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:54:31,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:54:31,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-02-09 23:54:31,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:54:31,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:31,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:31,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:31,493 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:31,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:54:31,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:54:31,502 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:54:31,502 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:54:31,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:54:31,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-02-09 23:54:31,527 INFO L401 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2024-02-09 23:54:31,527 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:54:31,565 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:54:31,607 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2024-02-09 23:54:31,607 INFO L444 ModelExtractionUtils]: 31 out of 46 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-02-09 23:54:31,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:54:31,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:54:31,608 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:54:31,631 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:54:31,639 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:54:31,639 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:54:31,639 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerWithAssertThread1of1ForFork0_steal_num#1) = 3*N - 2*cnt + 2*workerWithAssertThread1of1ForFork0_steal_num#1 Supporting invariants [-2*cnt + 3*N >= 0] [2024-02-09 23:54:31,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-02-09 23:54:31,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-02-09 23:54:31,647 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:54:31,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:54:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:54:31,683 WARN L260 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2024-02-09 23:54:31,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:54:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:54:32,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:54:32,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:54:32,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:54:32,197 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 4 loop predicates [2024-02-09 23:54:32,198 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:54:32,705 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 1318 transitions.16 powerset states13 rank states. The highest rank that occured is 1 [2024-02-09 23:54:32,706 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:54:32,706 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:55:11,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0