/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 --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -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-10 00:28:30,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:28:30,669 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-10 00:28:30,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:28:30,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:28:30,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:28:30,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:28:30,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:28:30,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:28:30,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:28:30,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:28:30,746 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:28:30,746 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:28:30,746 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:28:30,747 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:28:30,747 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:28:30,759 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:28:30,759 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:28:30,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:28:30,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:28:30,761 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:28:30,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:28:30,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:28:30,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:28:30,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:28:30,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:28:30,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:28:30,762 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:28:30,763 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:28:30,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:28:30,763 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:28:30,764 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:28:30,764 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:28:30,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:28:30,764 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:28:30,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:28:30,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:28:30,765 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:28:30,765 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 00:28:31,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:28:31,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:28:31,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:28:31,198 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:28:31,199 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:28:31,200 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-10 00:28:31,201 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/work-steal2.bpl' [2024-02-10 00:28:31,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:28:31,275 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:28:31,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:28:31,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:28:31,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:28:31,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:31" (1/1) ... [2024-02-10 00:28:31,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:31" (1/1) ... [2024-02-10 00:28:31,393 INFO L138 Inliner]: procedures = 4, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2024-02-10 00:28:31,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:28:31,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:28:31,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:28:31,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:28:31,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:31" (1/1) ... [2024-02-10 00:28:31,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:31" (1/1) ... [2024-02-10 00:28:31,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:31" (1/1) ... [2024-02-10 00:28:31,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:31" (1/1) ... [2024-02-10 00:28:31,428 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:31" (1/1) ... [2024-02-10 00:28:31,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:31" (1/1) ... [2024-02-10 00:28:31,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:31" (1/1) ... [2024-02-10 00:28:31,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:31" (1/1) ... [2024-02-10 00:28:31,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:28:31,439 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:28:31,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:28:31,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:28:31,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:31" (1/1) ... [2024-02-10 00:28:31,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:31,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:31,474 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-10 00:28:31,529 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-10 00:28:31,575 INFO L124 BoogieDeclarations]: Specification and implementation of procedure workerWithAssert given in one single declaration [2024-02-10 00:28:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure workerWithAssert [2024-02-10 00:28:31,575 INFO L138 BoogieDeclarations]: Found implementation of procedure workerWithAssert [2024-02-10 00:28:31,576 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:28:31,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:28:31,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:28:31,585 INFO L124 BoogieDeclarations]: Specification and implementation of procedure worker given in one single declaration [2024-02-10 00:28:31,585 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2024-02-10 00:28:31,585 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2024-02-10 00:28:31,586 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 00:28:31,734 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:28:31,737 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:28:31,986 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:28:32,055 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:28:32,063 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-10 00:28:32,066 INFO L201 PluginConnector]: Adding new model work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:28:32 BoogieIcfgContainer [2024-02-10 00:28:32,073 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:28:32,075 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:28:32,075 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:28:32,083 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:28:32,084 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:28:32,084 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:31" (1/2) ... [2024-02-10 00:28:32,086 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21f3d6f6 and model type work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:28:32, skipping insertion in model container [2024-02-10 00:28:32,086 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:28:32,094 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:28:32" (2/2) ... [2024-02-10 00:28:32,096 INFO L332 chiAutomizerObserver]: Analyzing ICFG work-steal2.bpl [2024-02-10 00:28:32,237 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-10 00:28:32,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 32 transitions, 72 flow [2024-02-10 00:28:32,303 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-02-10 00:28:32,303 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 00:28:32,309 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-10 00:28:32,309 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 32 transitions, 72 flow [2024-02-10 00:28:32,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 62 flow [2024-02-10 00:28:32,326 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:28:32,326 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:28:32,327 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:28:32,327 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:28:32,327 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:28:32,327 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:28:32,327 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:28:32,327 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:28:32,327 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:28:32,331 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 31 places, 28 transitions, 62 flow [2024-02-10 00:28:32,393 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 234 states, 232 states have (on average 2.663793103448276) internal successors, (618), 233 states have internal predecessors, (618), 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-10 00:28:32,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 234 states, 232 states have (on average 2.663793103448276) internal successors, (618), 233 states have internal predecessors, (618), 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-10 00:28:32,450 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 216 [2024-02-10 00:28:32,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:28:32,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:28:32,455 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:28:32,456 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:28:32,456 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 31 places, 28 transitions, 62 flow [2024-02-10 00:28:32,477 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 234 states, 232 states have (on average 2.663793103448276) internal successors, (618), 233 states have internal predecessors, (618), 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-10 00:28:32,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 234 states, 232 states have (on average 2.663793103448276) internal successors, (618), 233 states have internal predecessors, (618), 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-10 00:28:32,493 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 216 [2024-02-10 00:28:32,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:28:32,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:28:32,501 INFO L748 eck$LassoCheckResult]: Stem: Black: 506#[$Ultimate##0]don't care [91] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[] 509#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 511#[L29]don't care [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] 513#[L38, L29-1]don't care [2024-02-10 00:28:32,504 INFO L750 eck$LassoCheckResult]: Loop: 513#[L38, L29-1]don't care [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] 517#[L39, L29-1]don't care [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] 531#[L67, L29-1]don't care [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] 559#[L68-1, L29-1]don't care [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] 597#[L39-1, L29-1]don't care [102] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1] 639#[L40, L29-1]don't care [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[] 681#[L43, L29-1]don't care [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[] 727#[L44, L29-1]don't care [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] 513#[L38, L29-1]don't care [2024-02-10 00:28:32,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:32,513 INFO L85 PathProgramCache]: Analyzing trace with hash 119812, now seen corresponding path program 1 times [2024-02-10 00:28:32,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:32,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945594811] [2024-02-10 00:28:32,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:32,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:32,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:32,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:32,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:32,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2033960711, now seen corresponding path program 1 times [2024-02-10 00:28:32,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:32,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95669043] [2024-02-10 00:28:32,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:32,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:32,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:32,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:32,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:32,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1358358538, now seen corresponding path program 1 times [2024-02-10 00:28:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:32,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748972868] [2024-02-10 00:28:32,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:32,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:32,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:32,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:33,212 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:28:33,213 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:28:33,213 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:28:33,213 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:28:33,213 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:28:33,213 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:33,213 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:28:33,214 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:28:33,214 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:28:33,214 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:28:33,214 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:28:33,247 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-10 00:28:33,275 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-10 00:28:33,288 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-10 00:28:33,501 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:28:33,504 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:28:33,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:33,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:33,522 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-10 00:28:33,526 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-10 00:28:33,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:33,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:33,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:33,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:33,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:33,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:33,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:33,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:33,559 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-10 00:28:33,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:33,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:33,560 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-10 00:28:33,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:33,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:33,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:28:33,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:33,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:33,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:33,588 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-10 00:28:33,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:28:33,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:28:33,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:33,622 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-10 00:28:33,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:33,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:33,624 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-10 00:28:33,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:33,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:33,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:28:33,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:33,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:33,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:33,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:28:33,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:28:33,646 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-10 00:28:33,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:33,665 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-10 00:28:33,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:33,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:33,667 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-10 00:28:33,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:33,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:33,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:28:33,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:33,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:33,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:33,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:28:33,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:28:33,712 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-10 00:28:33,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:33,726 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-10 00:28:33,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:33,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:33,741 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-10 00:28:33,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10 00:28:33,796 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-10 00:28:33,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:33,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:33,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:33,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:33,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:33,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:33,836 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:28:33,850 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-10 00:28:33,850 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 00:28:33,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:33,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:33,882 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-10 00:28:33,896 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-10 00:28:33,901 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:28:33,924 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:28:33,924 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:28:33,925 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2024-02-10 00:28:33,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-02-10 00:28:33,932 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:28:34,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:34,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:28:34,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:34,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 00:28:34,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:34,226 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-10 00:28:34,258 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-10 00:28:34,259 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-10 00:28:35,099 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-10 00:28:35,100 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:28:35,100 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:28:35,101 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:28:35,154 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:28:35,154 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:28:35,176 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-10 00:28:35,181 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-10 00:28:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2024-02-10 00:28:35,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 210 transitions. Stem has 3 letters. Loop has 8 letters. [2024-02-10 00:28:35,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:35,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 210 transitions. Stem has 11 letters. Loop has 8 letters. [2024-02-10 00:28:35,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:35,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 210 transitions. Stem has 3 letters. Loop has 16 letters. [2024-02-10 00:28:35,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:35,184 INFO L428 stractBuchiCegarLoop]: Abstraction has has 45 places, 553 transitions, 2314 flow [2024-02-10 00:28:35,184 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:28:35,184 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:28:35,184 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 45 places, 553 transitions, 2314 flow [2024-02-10 00:28:35,239 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 521 states, 509 states have (on average 3.237721021611002) internal successors, (1648), 520 states have internal predecessors, (1648), 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-10 00:28:35,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 521 states, 509 states have (on average 3.237721021611002) internal successors, (1648), 520 states have internal predecessors, (1648), 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-10 00:28:35,262 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2024-02-10 00:28:35,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:28:35,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:28:35,264 INFO L748 eck$LassoCheckResult]: Stem: Black: 1045#[$Ultimate##0]don't care [91] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[] Black: 1048#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] Black: 1053#[L29]don't care [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] Black: 1058#[L38, L29-1]don't care [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] Black: 1061#[L38, ULTIMATE.startFINAL, L53]don't care [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] Black: 1081#[L38, L54, ULTIMATE.startFINAL]don't care [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] Black: 1131#[L38, ULTIMATE.startFINAL, L67]don't care [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] 1216#[L38, L68-1, ULTIMATE.startFINAL]don't care [2024-02-10 00:28:35,264 INFO L750 eck$LassoCheckResult]: Loop: 1216#[L38, L68-1, ULTIMATE.startFINAL]don't care [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] 1315#[L38, L54-1, ULTIMATE.startFINAL]don't care [114] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1] 1402#[L38, ULTIMATE.startFINAL, L55]don't care [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[] 1482#[L38, ULTIMATE.startFINAL, L58]don't care [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[] 1590#[L38, L59, ULTIMATE.startFINAL]don't care [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] 1744#[L38, ULTIMATE.startFINAL, L53]don't care [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] 1902#[L38, ULTIMATE.startFINAL, L54]don't care [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] 2008#[L38, ULTIMATE.startFINAL, L67]don't care [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] 1216#[L38, L68-1, ULTIMATE.startFINAL]don't care [2024-02-10 00:28:35,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:35,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1016450250, now seen corresponding path program 1 times [2024-02-10 00:28:35,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:35,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133433785] [2024-02-10 00:28:35,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:35,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:35,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:35,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:35,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:35,298 INFO L85 PathProgramCache]: Analyzing trace with hash -909521573, now seen corresponding path program 1 times [2024-02-10 00:28:35,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:35,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704379018] [2024-02-10 00:28:35,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:35,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:35,323 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:35,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:35,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:35,331 INFO L85 PathProgramCache]: Analyzing trace with hash -679740528, now seen corresponding path program 1 times [2024-02-10 00:28:35,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:35,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490586907] [2024-02-10 00:28:35,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:35,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:35,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:35,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:36,009 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:28:36,009 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:28:36,009 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:28:36,009 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:28:36,009 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:28:36,009 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:36,010 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:28:36,010 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:28:36,010 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:28:36,010 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:28:36,010 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:28:36,015 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-10 00:28:36,017 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-10 00:28:36,023 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-10 00:28:36,025 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-10 00:28:36,027 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-10 00:28:36,029 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-10 00:28:36,031 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-10 00:28:36,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-10 00:28:36,278 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-10 00:28:36,281 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-10 00:28:36,282 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-10 00:28:36,608 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:28:36,608 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:28:36,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:36,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:36,611 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-10 00:28:36,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10 00:28:36,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:36,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:28:36,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:36,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:36,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:36,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:28:36,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:28:36,624 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-10 00:28:36,633 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:36,639 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-10 00:28:36,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:36,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:36,651 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-10 00:28:36,672 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-10 00:28:36,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:36,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:36,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:36,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:36,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:36,684 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:36,684 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:36,704 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:36,723 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-10 00:28:36,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:36,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:36,728 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-10 00:28:36,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10 00:28:36,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:36,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:36,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:36,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:36,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:36,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:36,768 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-10 00:28:36,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:36,792 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-10 00:28:36,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:36,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:36,794 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-10 00:28:36,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10 00:28:36,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:36,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:28:36,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:36,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:36,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:36,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:28:36,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:28:36,816 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-10 00:28:36,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:36,840 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-10 00:28:36,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:36,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:36,842 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-10 00:28:36,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:36,854 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-10 00:28:36,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:36,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:28:36,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:36,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:36,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:36,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:28:36,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:28:36,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:36,877 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-10 00:28:36,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:36,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:36,880 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-10 00:28:36,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:36,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:36,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:28:36,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:36,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:36,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:36,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:28:36,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:28:36,896 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-10 00:28:36,896 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:36,902 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-10 00:28:36,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:36,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:36,904 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-10 00:28:36,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:36,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:36,917 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-02-10 00:28:36,918 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-10 00:28:36,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:36,924 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-10 00:28:36,965 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2024-02-10 00:28:36,965 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-10 00:28:37,020 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:28:37,059 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-02-10 00:28:37,059 INFO L444 ModelExtractionUtils]: 22 out of 36 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-02-10 00:28:37,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:37,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:37,077 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-10 00:28:37,084 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:28:37,089 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-10 00:28:37,106 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-10 00:28:37,107 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:28:37,107 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-10 00:28:37,115 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-10 00:28:37,119 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 00:28:37,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:37,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-10 00:28:37,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:37,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-10 00:28:37,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:37,388 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-10 00:28:37,389 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-10 00:28:37,389 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-10 00:28:37,823 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-10 00:28:37,823 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:28:37,823 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:28:37,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states and 1318 transitions. [2024-02-10 00:28:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1318 transitions. [2024-02-10 00:28:37,833 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:28:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states and 1318 transitions. [2024-02-10 00:28:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1318 transitions. [2024-02-10 00:28:37,958 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-10 00:28:39,024 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:28:39,024 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:28:39,025 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-10 00:28:39,025 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-10 00:28:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 427 transitions. [2024-02-10 00:28:39,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 427 transitions. Stem has 7 letters. Loop has 8 letters. [2024-02-10 00:28:39,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:39,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 427 transitions. Stem has 15 letters. Loop has 8 letters. [2024-02-10 00:28:39,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:39,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 427 transitions. Stem has 7 letters. Loop has 16 letters. [2024-02-10 00:28:39,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:39,029 INFO L428 stractBuchiCegarLoop]: Abstraction has has 88 places, 30344 transitions, 187248 flow [2024-02-10 00:28:39,029 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:28:39,029 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:28:39,029 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 88 places, 30344 transitions, 187248 flow [2024-02-10 00:28:42,480 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1839 states, 1782 states have (on average 3.9332210998877666) internal successors, (7009), 1838 states have internal predecessors, (7009), 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-10 00:28:42,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1839 states, 1782 states have (on average 3.9332210998877666) internal successors, (7009), 1838 states have internal predecessors, (7009), 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-10 00:28:42,556 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 416 [2024-02-10 00:28:42,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:28:42,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:28:42,559 INFO L748 eck$LassoCheckResult]: Stem: Black: 2380#[$Ultimate##0]don't care [91] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[] Black: 2383#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] Black: 2395#[L29]don't care [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] Black: 2409#[L38, L29-1]don't care [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] Black: 2427#[L39, L29-1]don't care [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] Black: 2527#[L29-1, L67]don't care [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] Black: 2667#[L67, L53, ULTIMATE.startFINAL]don't care [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] Black: 2782#[L67, L54, ULTIMATE.startFINAL]don't care [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] Black: 3031#[L67, ULTIMATE.startFINAL, L67]don't care [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] Black: 3344#[L67, L68-1, ULTIMATE.startFINAL]don't care [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] Black: 3607#[L68-1, L68-1, ULTIMATE.startFINAL]don't care [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] 3951#[L54-1, L68-1, ULTIMATE.startFINAL]don't care [2024-02-10 00:28:42,559 INFO L750 eck$LassoCheckResult]: Loop: 3951#[L54-1, L68-1, ULTIMATE.startFINAL]don't care [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] Black: 4360#[L54-1, L39-1, ULTIMATE.startFINAL]don't care [102] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1] 4876#[L54-1, L40, ULTIMATE.startFINAL]don't care [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[] Black: 5420#[L54-1, L43, ULTIMATE.startFINAL]don't care [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[] 5928#[L54-1, L44, ULTIMATE.startFINAL]don't care [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] Black: 6379#[L54-1, ULTIMATE.startFINAL, L38]don't care [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] 6731#[L39, L54-1, ULTIMATE.startFINAL]don't care [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] Black: 6949#[L67, L54-1, ULTIMATE.startFINAL]don't care [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] 3951#[L54-1, L68-1, ULTIMATE.startFINAL]don't care [2024-02-10 00:28:42,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:42,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2052168645, now seen corresponding path program 1 times [2024-02-10 00:28:42,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:42,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475921791] [2024-02-10 00:28:42,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:42,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:42,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:42,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:42,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:42,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1532400443, now seen corresponding path program 2 times [2024-02-10 00:28:42,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:42,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185990837] [2024-02-10 00:28:42,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:42,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:42,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:42,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:42,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:42,660 INFO L85 PathProgramCache]: Analyzing trace with hash -398316801, now seen corresponding path program 1 times [2024-02-10 00:28:42,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:42,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064041141] [2024-02-10 00:28:42,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:42,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:42,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:42,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:43,110 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:28:43,110 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:28:43,111 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:28:43,111 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:28:43,111 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:28:43,111 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:43,111 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:28:43,111 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:28:43,111 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration3_Lasso [2024-02-10 00:28:43,111 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:28:43,111 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:28:43,117 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-10 00:28:43,122 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-10 00:28:43,125 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-10 00:28:43,128 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-10 00:28:43,648 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-10 00:28:43,651 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-10 00:28:43,942 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-02-10 00:28:44,453 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:28:44,453 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:28:44,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:44,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:44,467 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-10 00:28:44,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10 00:28:44,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:44,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:44,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:44,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:44,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:44,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:44,500 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-10 00:28:44,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:44,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-02-10 00:28:44,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:44,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:44,592 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-10 00:28:44,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10 00:28:44,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:44,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:44,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:44,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:44,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:44,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:44,609 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-10 00:28:44,617 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:44,623 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-10 00:28:44,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:44,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:44,624 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-10 00:28:44,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:44,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:44,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:44,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:44,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:44,641 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-10 00:28:44,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:44,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:44,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:44,680 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-10 00:28:44,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:44,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:44,682 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-10 00:28:44,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:44,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:44,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:28:44,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:44,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:44,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:44,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:28:44,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:28:44,700 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-10 00:28:44,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:44,714 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-10 00:28:44,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:44,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:44,715 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-10 00:28:44,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:44,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:44,733 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-10 00:28:44,733 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-10 00:28:44,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:44,752 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-10 00:28:44,800 INFO L401 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2024-02-10 00:28:44,800 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-10 00:28:44,842 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:28:44,891 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-02-10 00:28:44,892 INFO L444 ModelExtractionUtils]: 40 out of 56 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-02-10 00:28:44,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:44,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:44,893 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-10 00:28:44,895 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-10 00:28:44,896 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:28:44,909 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-10 00:28:44,909 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:28:44,909 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-10 00:28:44,917 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-10 00:28:44,920 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 00:28:44,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:44,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-10 00:28:44,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:45,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-10 00:28:45,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:45,369 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-10 00:28:45,369 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 4 loop predicates [2024-02-10 00:28:45,370 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-10 00:28:46,193 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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 42 states and 1902 transitions.23 powerset states19 rank states. The highest rank that occured is 1 [2024-02-10 00:28:46,194 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:28:46,194 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:28:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states and 1902 transitions. [2024-02-10 00:28:46,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 1902 transitions. [2024-02-10 00:28:46,197 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:28:46,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states and 1902 transitions. [2024-02-10 00:28:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 1902 transitions. [2024-02-10 00:28:46,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-02-10 00:30:18,547 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:30:18,548 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:30:18,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 10 stem states 9 non-accepting loop states 2 accepting loop states [2024-02-10 00:30:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-10 00:30:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 651 transitions. [2024-02-10 00:30:18,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 651 transitions. Stem has 11 letters. Loop has 8 letters. [2024-02-10 00:30:18,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:30:18,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 651 transitions. Stem has 19 letters. Loop has 8 letters. [2024-02-10 00:30:18,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:30:18,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 651 transitions. Stem has 11 letters. Loop has 16 letters. [2024-02-10 00:30:18,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:30:18,550 INFO L428 stractBuchiCegarLoop]: Abstraction has has 150 places, 2400711 transitions, 19608546 flow [2024-02-10 00:30:18,550 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 00:30:18,550 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:30:18,550 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 150 places, 2400711 transitions, 19608546 flow