/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_AUTOMATON -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/work-steal2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:25:22,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:25:22,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-09 23:25:22,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:25:22,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:25:22,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:25:22,489 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:25:22,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:25:22,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:25:22,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:25:22,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:25:22,495 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:25:22,495 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:25:22,496 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:25:22,497 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:25:22,497 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:25:22,497 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:25:22,497 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:25:22,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:25:22,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:25:22,498 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:25:22,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:25:22,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:25:22,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:25:22,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:25:22,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:25:22,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:25:22,500 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:25:22,501 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:25:22,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:25:22,502 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:25:22,502 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:25:22,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:25:22,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:25:22,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:25:22,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:25:22,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:25:22,504 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:25:22,504 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_AUTOMATON [2024-02-09 23:25:22,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:25:22,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:25:22,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:25:22,853 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-09 23:25:22,854 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-09 23:25:22,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/work-steal2.bpl [2024-02-09 23:25:22,855 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/work-steal2.bpl' [2024-02-09 23:25:22,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:25:22,881 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-09 23:25:22,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:25:22,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:25:22,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:25:22,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:22" (1/1) ... [2024-02-09 23:25:22,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:22" (1/1) ... [2024-02-09 23:25:22,914 INFO L138 Inliner]: procedures = 4, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2024-02-09 23:25:22,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:25:22,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:25:22,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:25:22,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:25:22,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:22" (1/1) ... [2024-02-09 23:25:22,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:22" (1/1) ... [2024-02-09 23:25:22,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:22" (1/1) ... [2024-02-09 23:25:22,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:22" (1/1) ... [2024-02-09 23:25:22,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:22" (1/1) ... [2024-02-09 23:25:22,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:22" (1/1) ... [2024-02-09 23:25:22,932 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:22" (1/1) ... [2024-02-09 23:25:22,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:22" (1/1) ... [2024-02-09 23:25:22,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:25:22,934 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:25:22,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:25:22,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:25:22,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:22" (1/1) ... [2024-02-09 23:25:22,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:22,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:22,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:22,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-09 23:25:23,025 INFO L124 BoogieDeclarations]: Specification and implementation of procedure workerWithAssert given in one single declaration [2024-02-09 23:25:23,025 INFO L130 BoogieDeclarations]: Found specification of procedure workerWithAssert [2024-02-09 23:25:23,025 INFO L138 BoogieDeclarations]: Found implementation of procedure workerWithAssert [2024-02-09 23:25:23,026 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-09 23:25:23,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:25:23,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:25:23,026 INFO L124 BoogieDeclarations]: Specification and implementation of procedure worker given in one single declaration [2024-02-09 23:25:23,027 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2024-02-09 23:25:23,027 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2024-02-09 23:25:23,027 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-09 23:25:23,075 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:25:23,078 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:25:23,188 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:25:23,227 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:25:23,228 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-09 23:25:23,230 INFO L201 PluginConnector]: Adding new model work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:25:23 BoogieIcfgContainer [2024-02-09 23:25:23,230 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:25:23,231 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:25:23,231 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:25:23,234 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:25:23,235 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:25:23,235 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:22" (1/2) ... [2024-02-09 23:25:23,237 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2af4f5e3 and model type work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:25:23, skipping insertion in model container [2024-02-09 23:25:23,238 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:25:23,238 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:25:23" (2/2) ... [2024-02-09 23:25:23,239 INFO L332 chiAutomizerObserver]: Analyzing ICFG work-steal2.bpl [2024-02-09 23:25:23,297 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-09 23:25:23,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 32 transitions, 72 flow [2024-02-09 23:25:23,341 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-02-09 23:25:23,341 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-09 23:25:23,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 4/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-02-09 23:25:23,345 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 32 transitions, 72 flow [2024-02-09 23:25:23,350 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 62 flow [2024-02-09 23:25:23,362 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:25:23,362 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:25:23,362 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:25:23,362 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:25:23,362 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:25:23,363 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:25:23,363 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:25:23,363 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-02-09 23:25:23,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2024-02-09 23:25:23,441 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 216 [2024-02-09 23:25:23,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:23,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:23,446 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-02-09 23:25:23,446 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:23,446 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:25:23,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 233 states, but on-demand construction may add more states [2024-02-09 23:25:23,459 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 216 [2024-02-09 23:25:23,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:23,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:23,460 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-02-09 23:25:23,460 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:23,465 INFO L748 eck$LassoCheckResult]: Stem: 36#[$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[] 39#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 41#[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] 43#[L38, L29-1]don't care [2024-02-09 23:25:23,466 INFO L750 eck$LassoCheckResult]: Loop: 43#[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] 45#[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] 51#[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] 65#[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] 91#[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] 129#[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[] 171#[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[] 215#[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] 43#[L38, L29-1]don't care [2024-02-09 23:25:23,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:23,471 INFO L85 PathProgramCache]: Analyzing trace with hash 119812, now seen corresponding path program 1 times [2024-02-09 23:25:23,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:23,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142419442] [2024-02-09 23:25:23,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:23,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:23,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:23,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:23,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:23,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2033960711, now seen corresponding path program 1 times [2024-02-09 23:25:23,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:23,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215027520] [2024-02-09 23:25:23,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:23,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:23,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:23,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:23,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:23,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1358358538, now seen corresponding path program 1 times [2024-02-09 23:25:23,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:23,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650615624] [2024-02-09 23:25:23,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:23,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:23,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:23,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:23,910 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:25:23,910 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:25:23,910 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:25:23,910 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:25:23,910 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:25:23,910 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:23,911 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:25:23,911 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:25:23,911 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration1_Lasso [2024-02-09 23:25:23,911 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:25:23,911 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:25:23,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:23,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:23,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:24,139 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:25:24,142 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:25:24,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:24,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:24,145 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:24,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-09 23:25:24,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:24,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:24,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:24,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:24,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:24,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:24,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:24,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:24,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:24,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:24,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:24,184 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:24,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-09 23:25:24,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:24,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:24,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:24,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:24,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:24,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:24,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:24,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:24,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:24,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:24,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:24,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:24,261 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:24,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:24,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:24,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:24,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:24,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:24,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:24,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:24,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:24,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-09 23:25:24,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:24,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:24,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:24,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:24,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:24,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:24,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:24,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:24,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:24,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:24,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:24,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:24,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:24,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-09 23:25:24,320 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:24,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:24,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:24,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:24,325 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:24,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-09 23:25:24,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:24,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:24,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:24,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:24,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:24,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:24,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:24,369 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:25:24,386 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-09 23:25:24,387 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-09 23:25:24,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:24,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:24,394 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:24,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-09 23:25:24,396 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:25:24,405 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:25:24,405 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:25:24,406 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2024-02-09 23:25:24,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:24,416 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:25:24,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:24,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:25:24,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:24,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-09 23:25:24,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:24,816 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-09 23:25:24,818 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 233 states, but on-demand construction may add more states Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:25,016 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 233 states, but on-demand construction may add more states. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (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 553 states and 1420 transitions. Complement of second has 9 states. [2024-02-09 23:25:25,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-02-09 23:25:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2024-02-09 23:25:25,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 3 letters. Loop has 8 letters. [2024-02-09 23:25:25,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:25,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 11 letters. Loop has 8 letters. [2024-02-09 23:25:25,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:25,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 3 letters. Loop has 16 letters. [2024-02-09 23:25:25,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:25,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 553 states and 1420 transitions. [2024-02-09 23:25:25,043 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2024-02-09 23:25:25,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 553 states to 386 states and 984 transitions. [2024-02-09 23:25:25,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 299 [2024-02-09 23:25:25,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 324 [2024-02-09 23:25:25,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 984 transitions. [2024-02-09 23:25:25,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:25,059 INFO L218 hiAutomatonCegarLoop]: Abstraction has 386 states and 984 transitions. [2024-02-09 23:25:25,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 984 transitions. [2024-02-09 23:25:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 332. [2024-02-09 23:25:25,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 332 states have (on average 2.6144578313253013) internal successors, (868), 331 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 868 transitions. [2024-02-09 23:25:25,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 332 states and 868 transitions. [2024-02-09 23:25:25,120 INFO L428 stractBuchiCegarLoop]: Abstraction has 332 states and 868 transitions. [2024-02-09 23:25:25,121 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:25:25,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 332 states and 868 transitions. [2024-02-09 23:25:25,125 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2024-02-09 23:25:25,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:25,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:25,126 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-02-09 23:25:25,126 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:25,127 INFO L748 eck$LassoCheckResult]: Stem: 1682#[$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[] 1242#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 1244#[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] 1746#[L38, L29-1]don't care [97] L38-->L41: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1208#[L41, 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] 1322#[ULTIMATE.startFINAL, L53, L41]don't care [2024-02-09 23:25:25,127 INFO L750 eck$LassoCheckResult]: Loop: 1322#[ULTIMATE.startFINAL, L53, L41]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] 1324#[ULTIMATE.startFINAL, L41, 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] 1396#[L67, ULTIMATE.startFINAL, L41]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] 1560#[ULTIMATE.startFINAL, L41, L68-1]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] 1696#[ULTIMATE.startFINAL, L54-1, L41]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] 1222#[ULTIMATE.startFINAL, L55, L41]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[] 1492#[ULTIMATE.startFINAL, L58, L41]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[] 1494#[ULTIMATE.startFINAL, L41, L59]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] 1322#[ULTIMATE.startFINAL, L53, L41]don't care [2024-02-09 23:25:25,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:25,129 INFO L85 PathProgramCache]: Analyzing trace with hash 115142463, now seen corresponding path program 1 times [2024-02-09 23:25:25,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:25,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954340626] [2024-02-09 23:25:25,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:25,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:25,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:25,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:25,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:25,163 INFO L85 PathProgramCache]: Analyzing trace with hash -407008025, now seen corresponding path program 1 times [2024-02-09 23:25:25,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:25,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315805051] [2024-02-09 23:25:25,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:25,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:25,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:25,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:25,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:25,181 INFO L85 PathProgramCache]: Analyzing trace with hash 516840997, now seen corresponding path program 1 times [2024-02-09 23:25:25,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:25,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631546624] [2024-02-09 23:25:25,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:25,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:25,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:25,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:25,321 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:25:25,321 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:25:25,321 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:25:25,321 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:25:25,321 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:25:25,321 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:25,321 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:25:25,321 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:25:25,321 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration2_Lasso [2024-02-09 23:25:25,321 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:25:25,321 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:25:25,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:25,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:25,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:25,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:25,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:25,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:25,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:25,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:25,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:25,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:25,461 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-09 23:25:25,522 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:25:25,522 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:25:25,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:25,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:25,524 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:25,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-09 23:25:25,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:25,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:25,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:25,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:25,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:25,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:25,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:25,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:25,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:25,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:25,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:25,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:25,563 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:25,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:25,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:25,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:25,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:25,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:25,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:25,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:25,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-09 23:25:25,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:25,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:25,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:25,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:25,608 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:25,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-09 23:25:25,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:25,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:25,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:25,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:25,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:25,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:25,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:25,652 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:25,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:25,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:25,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:25,660 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:25,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-09 23:25:25,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-09 23:25:25,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:25,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:25,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:25,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:25,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:25,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:25,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:25,697 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:25,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:25,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:25,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:25,706 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:25,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:25,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:25,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:25,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:25,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:25,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:25,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:25,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:25,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-09 23:25:25,734 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:25,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:25,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:25,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:25,742 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:25,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:25,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:25,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:25,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:25,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:25,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:25,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:25,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:25,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-09 23:25:25,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:25,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:25,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:25,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:25,779 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:25,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:25,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:25,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:25,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:25,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:25,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:25,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:25,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-09 23:25:25,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:25,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:25,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:25,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:25,813 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:25,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-02-09 23:25:25,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:25,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:25,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:25,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:25,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:25,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:25,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:25,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:25,840 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:25,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:25,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:25,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:25,844 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:25,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-02-09 23:25:25,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:25,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:25,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:25,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:25,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:25,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:25,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:25,870 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:25:25,878 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-09 23:25:25,879 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-09 23:25:25,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:25,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:25,880 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:25,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-02-09 23:25:25,889 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:25:25,905 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:25:25,905 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:25:25,905 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2024-02-09 23:25:25,909 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-09 23:25:25,910 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:25:25,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:25,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:25:25,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:25,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-09 23:25:25,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:26,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:26,128 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-09 23:25:26,129 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 332 states and 868 transitions. cyclomatic complexity: 555 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:26,273 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 332 states and 868 transitions. cyclomatic complexity: 555. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 1135 states and 2999 transitions. Complement of second has 9 states. [2024-02-09 23:25:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-02-09 23:25:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:26,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2024-02-09 23:25:26,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 78 transitions. Stem has 5 letters. Loop has 8 letters. [2024-02-09 23:25:26,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:26,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 78 transitions. Stem has 13 letters. Loop has 8 letters. [2024-02-09 23:25:26,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:26,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 78 transitions. Stem has 5 letters. Loop has 16 letters. [2024-02-09 23:25:26,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:26,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1135 states and 2999 transitions. [2024-02-09 23:25:26,291 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2024-02-09 23:25:26,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1135 states to 907 states and 2314 transitions. [2024-02-09 23:25:26,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 518 [2024-02-09 23:25:26,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 597 [2024-02-09 23:25:26,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 907 states and 2314 transitions. [2024-02-09 23:25:26,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:26,303 INFO L218 hiAutomatonCegarLoop]: Abstraction has 907 states and 2314 transitions. [2024-02-09 23:25:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states and 2314 transitions. [2024-02-09 23:25:26,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 731. [2024-02-09 23:25:26,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 731 states have (on average 2.6292749658002736) internal successors, (1922), 730 states have internal predecessors, (1922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1922 transitions. [2024-02-09 23:25:26,335 INFO L240 hiAutomatonCegarLoop]: Abstraction has 731 states and 1922 transitions. [2024-02-09 23:25:26,335 INFO L428 stractBuchiCegarLoop]: Abstraction has 731 states and 1922 transitions. [2024-02-09 23:25:26,335 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:25:26,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 731 states and 1922 transitions. [2024-02-09 23:25:26,340 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2024-02-09 23:25:26,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:26,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:26,341 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:26,341 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:26,341 INFO L748 eck$LassoCheckResult]: Stem: 3781#[$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[] 3137#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 3139#[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] 3925#[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] 3397#[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] 3479#[L67, 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] 3483#[ULTIMATE.startFINAL, L53, L67]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] 3461#[L68-1, ULTIMATE.startFINAL, L53]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] 4319#[ULTIMATE.startFINAL, L53, L39-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] 4271#[L40, ULTIMATE.startFINAL, L53]don't care [103] L40-->L41: Formula: (<= |v_workerWithAssertThread1of1ForFork0_sz#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_3|} OutVars{workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_3|} AuxVars[] AssignedVars[] 3249#[ULTIMATE.startFINAL, L53, L41]don't care [2024-02-09 23:25:26,341 INFO L750 eck$LassoCheckResult]: Loop: 3249#[ULTIMATE.startFINAL, L53, L41]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] 3253#[ULTIMATE.startFINAL, L41, 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] 3587#[L67, ULTIMATE.startFINAL, L41]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] 3623#[ULTIMATE.startFINAL, L41, L68-1]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] 3813#[ULTIMATE.startFINAL, L54-1, L41]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] 3629#[ULTIMATE.startFINAL, L55, L41]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[] 3469#[ULTIMATE.startFINAL, L58, L41]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[] 3471#[ULTIMATE.startFINAL, L41, L59]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] 3249#[ULTIMATE.startFINAL, L53, L41]don't care [2024-02-09 23:25:26,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:26,342 INFO L85 PathProgramCache]: Analyzing trace with hash -903879624, now seen corresponding path program 1 times [2024-02-09 23:25:26,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:26,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823140680] [2024-02-09 23:25:26,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:26,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:26,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:26,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:26,413 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:26,413 INFO L85 PathProgramCache]: Analyzing trace with hash -407008025, now seen corresponding path program 2 times [2024-02-09 23:25:26,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:26,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297880445] [2024-02-09 23:25:26,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:26,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:26,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:26,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:26,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:26,428 INFO L85 PathProgramCache]: Analyzing trace with hash -261273058, now seen corresponding path program 1 times [2024-02-09 23:25:26,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:26,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701752086] [2024-02-09 23:25:26,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:26,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:26,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-02-09 23:25:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:26,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-09 23:25:26,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701752086] [2024-02-09 23:25:26,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701752086] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-09 23:25:26,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-09 23:25:26,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-09 23:25:26,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572845630] [2024-02-09 23:25:26,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-09 23:25:26,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-09 23:25:26,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-09 23:25:26,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-02-09 23:25:26,869 INFO L87 Difference]: Start difference. First operand 731 states and 1922 transitions. cyclomatic complexity: 1226 Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:27,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-02-09 23:25:27,079 INFO L93 Difference]: Finished difference Result 1453 states and 3720 transitions. [2024-02-09 23:25:27,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1453 states and 3720 transitions. [2024-02-09 23:25:27,095 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 320 [2024-02-09 23:25:27,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1453 states to 1425 states and 3662 transitions. [2024-02-09 23:25:27,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 930 [2024-02-09 23:25:27,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 930 [2024-02-09 23:25:27,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1425 states and 3662 transitions. [2024-02-09 23:25:27,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:27,108 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1425 states and 3662 transitions. [2024-02-09 23:25:27,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states and 3662 transitions. [2024-02-09 23:25:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 771. [2024-02-09 23:25:27,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 771 states have (on average 2.6251621271076524) internal successors, (2024), 770 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 2024 transitions. [2024-02-09 23:25:27,138 INFO L240 hiAutomatonCegarLoop]: Abstraction has 771 states and 2024 transitions. [2024-02-09 23:25:27,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-09 23:25:27,139 INFO L428 stractBuchiCegarLoop]: Abstraction has 771 states and 2024 transitions. [2024-02-09 23:25:27,140 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-09 23:25:27,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 771 states and 2024 transitions. [2024-02-09 23:25:27,145 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2024-02-09 23:25:27,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:27,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:27,146 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:27,146 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:27,147 INFO L748 eck$LassoCheckResult]: Stem: 6735#[$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[] 6077#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 6079#[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] 6883#[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] 6813#[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] 6815#[L67, 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] 7379#[ULTIMATE.startFINAL, L53, L67]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] 6397#[L68-1, 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] 6869#[L68-1, 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] 6857#[L68-1, L67, ULTIMATE.startFINAL]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] 6779#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:25:27,147 INFO L750 eck$LassoCheckResult]: Loop: 6779#[L68-1, ULTIMATE.startFINAL, L68-1]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] 6085#[L68-1, ULTIMATE.startFINAL, L54-1]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] 6795#[L68-1, 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[] 6153#[L68-1, 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[] 6243#[L68-1, ULTIMATE.startFINAL, L59]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] 7037#[L68-1, 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] 7317#[L68-1, 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] 7297#[L68-1, L67, ULTIMATE.startFINAL]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] 6779#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:25:27,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:27,148 INFO L85 PathProgramCache]: Analyzing trace with hash -903872640, now seen corresponding path program 1 times [2024-02-09 23:25:27,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:27,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556684589] [2024-02-09 23:25:27,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:27,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:27,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:27,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:27,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:27,175 INFO L85 PathProgramCache]: Analyzing trace with hash -909521573, now seen corresponding path program 3 times [2024-02-09 23:25:27,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:27,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586633695] [2024-02-09 23:25:27,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:27,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:27,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:27,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:27,188 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:27,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1116873254, now seen corresponding path program 1 times [2024-02-09 23:25:27,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:27,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703435300] [2024-02-09 23:25:27,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:27,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:27,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:27,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:27,617 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:25:27,617 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:25:27,617 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:25:27,617 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:25:27,617 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:25:27,617 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:27,617 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:25:27,617 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:25:27,617 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration4_Lasso [2024-02-09 23:25:27,617 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:25:27,618 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:25:27,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:27,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:27,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:27,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:27,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:27,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:27,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:27,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:28,409 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2024-02-09 23:25:28,817 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:25:28,817 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:25:28,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:28,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:28,826 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:28,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:28,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-02-09 23:25:28,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:28,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:28,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:28,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:28,846 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:28,846 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:28,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:28,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:28,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:28,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:28,868 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:28,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:28,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:28,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:28,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:28,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:28,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:28,885 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:28,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-02-09 23:25:28,900 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:28,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:28,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:28,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:28,908 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:28,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-02-09 23:25:28,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:28,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:28,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:28,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:28,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:28,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:28,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:28,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:28,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:28,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:28,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:28,956 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:28,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:28,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:28,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:28,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:28,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:28,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:28,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:28,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:28,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-02-09 23:25:28,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:28,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:28,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:28,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:28,996 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:29,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-02-09 23:25:29,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:29,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:29,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:29,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:29,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:29,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:29,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:29,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:29,009 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:29,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-02-09 23:25:29,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:29,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:29,013 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:29,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:29,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:29,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:29,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:29,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:29,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:29,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:29,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-02-09 23:25:29,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:29,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:29,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:29,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:29,045 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:29,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:29,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:29,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:29,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:29,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:29,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:29,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:29,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-02-09 23:25:29,076 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:29,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:29,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:29,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:29,081 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:29,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:29,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:29,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:29,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:29,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:29,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:29,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:29,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:29,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-02-09 23:25:29,108 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:29,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:29,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:29,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:29,115 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:29,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:29,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-02-09 23:25:29,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:29,128 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:25:29,128 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:25:29,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:29,154 INFO L401 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2024-02-09 23:25:29,154 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:25:29,201 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:25:29,250 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-02-09 23:25:29,250 INFO L444 ModelExtractionUtils]: 30 out of 46 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-02-09 23:25:29,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:29,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:29,252 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:29,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-02-09 23:25:29,257 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:25:29,265 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:25:29,266 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:25:29,266 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerThread1of1ForFork1_steal_num#1) = 1*N - 1*cnt + 1*workerThread1of1ForFork1_steal_num#1 Supporting invariants [-1*cnt + 1*N >= 0] [2024-02-09 23:25:29,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:29,275 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:25:29,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:29,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-09 23:25:29,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:29,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-09 23:25:29,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:29,462 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2024-02-09 23:25:29,462 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 771 states and 2024 transitions. cyclomatic complexity: 1288 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:29,601 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 771 states and 2024 transitions. cyclomatic complexity: 1288. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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 1906 states and 5048 transitions. Complement of second has 14 states. [2024-02-09 23:25:29,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 4 stem states 4 non-accepting loop states 1 accepting loop states [2024-02-09 23:25:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-02-09 23:25:29,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 101 transitions. Stem has 10 letters. Loop has 8 letters. [2024-02-09 23:25:29,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:29,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 101 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:25:29,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:29,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 101 transitions. Stem has 10 letters. Loop has 16 letters. [2024-02-09 23:25:29,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:29,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1906 states and 5048 transitions. [2024-02-09 23:25:29,621 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2024-02-09 23:25:29,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1906 states to 1578 states and 4060 transitions. [2024-02-09 23:25:29,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 770 [2024-02-09 23:25:29,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1008 [2024-02-09 23:25:29,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1578 states and 4060 transitions. [2024-02-09 23:25:29,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:29,635 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1578 states and 4060 transitions. [2024-02-09 23:25:29,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states and 4060 transitions. [2024-02-09 23:25:29,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1079. [2024-02-09 23:25:29,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1079 states have (on average 2.6413345690454126) internal successors, (2850), 1078 states have internal predecessors, (2850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 2850 transitions. [2024-02-09 23:25:29,664 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1079 states and 2850 transitions. [2024-02-09 23:25:29,664 INFO L428 stractBuchiCegarLoop]: Abstraction has 1079 states and 2850 transitions. [2024-02-09 23:25:29,664 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-02-09 23:25:29,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1079 states and 2850 transitions. [2024-02-09 23:25:29,670 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2024-02-09 23:25:29,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:29,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:29,671 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:29,671 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:29,671 INFO L748 eck$LassoCheckResult]: Stem: 10254#[$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[] 9628#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 9630#[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] 10430#[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] 9876#[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] 9954#[L67, 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] 9958#[ULTIMATE.startFINAL, L53, L67]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] 11130#[ULTIMATE.startFINAL, L67, 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] 11132#[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] 10388#[ULTIMATE.startFINAL, L67, L68-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] 10616#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:25:29,672 INFO L750 eck$LassoCheckResult]: Loop: 10616#[L68-1, ULTIMATE.startFINAL, L68-1]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] 10612#[L68-1, ULTIMATE.startFINAL, L54-1]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] 10614#[L68-1, 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[] 10666#[L68-1, 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[] 10664#[L68-1, ULTIMATE.startFINAL, L59]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] 10660#[L68-1, 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] 10662#[L68-1, 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] 10676#[L68-1, L67, ULTIMATE.startFINAL]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] 10616#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:25:29,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:29,672 INFO L85 PathProgramCache]: Analyzing trace with hash -903632340, now seen corresponding path program 2 times [2024-02-09 23:25:29,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:29,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597482457] [2024-02-09 23:25:29,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:29,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:29,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:29,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:29,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash -909521573, now seen corresponding path program 4 times [2024-02-09 23:25:29,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:29,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650519027] [2024-02-09 23:25:29,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:29,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:29,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:29,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:29,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:29,690 INFO L85 PathProgramCache]: Analyzing trace with hash 438443142, now seen corresponding path program 2 times [2024-02-09 23:25:29,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:29,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400926498] [2024-02-09 23:25:29,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:29,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:29,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:29,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:29,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:30,015 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:25:30,016 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:25:30,016 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:25:30,016 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:25:30,016 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:25:30,016 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:30,016 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:25:30,016 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:25:30,016 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration5_Lasso [2024-02-09 23:25:30,016 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:25:30,016 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:25:30,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:30,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:30,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:30,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:30,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:30,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:30,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:30,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:30,525 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2024-02-09 23:25:30,829 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:25:30,829 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:25:30,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:30,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:30,831 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:30,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-02-09 23:25:30,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:30,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:30,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:30,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:30,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:30,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:30,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:30,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:30,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:30,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-02-09 23:25:30,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:30,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:30,845 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:30,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-02-09 23:25:30,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:30,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:30,854 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:25:30,854 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:25:30,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:30,884 INFO L401 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2024-02-09 23:25:30,884 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:25:30,925 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:25:30,967 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-02-09 23:25:30,967 INFO L444 ModelExtractionUtils]: 31 out of 46 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-02-09 23:25:30,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:30,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:30,969 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:30,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-02-09 23:25:30,972 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:25:30,981 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:25:30,981 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:25:30,981 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerThread1of1ForFork1_steal_num#1) = 3*N - 2*cnt + 2*workerThread1of1ForFork1_steal_num#1 Supporting invariants [-2*cnt + 3*N >= 0] [2024-02-09 23:25:30,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-02-09 23:25:30,994 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:25:31,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:31,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:25:31,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:31,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:31,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:25:31,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:31,257 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 4 loop predicates [2024-02-09 23:25:31,257 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1079 states and 2850 transitions. cyclomatic complexity: 1822 Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:31,511 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1079 states and 2850 transitions. cyclomatic complexity: 1822. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 2750 states and 6993 transitions. Complement of second has 18 states. [2024-02-09 23:25:31,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 5 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:25:31,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 147 transitions. [2024-02-09 23:25:31,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 147 transitions. Stem has 10 letters. Loop has 8 letters. [2024-02-09 23:25:31,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:31,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 147 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:25:31,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:31,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 147 transitions. Stem has 10 letters. Loop has 16 letters. [2024-02-09 23:25:31,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:31,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2750 states and 6993 transitions. [2024-02-09 23:25:31,536 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2024-02-09 23:25:31,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2750 states to 2268 states and 5814 transitions. [2024-02-09 23:25:31,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1373 [2024-02-09 23:25:31,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1491 [2024-02-09 23:25:31,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2268 states and 5814 transitions. [2024-02-09 23:25:31,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:31,554 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2268 states and 5814 transitions. [2024-02-09 23:25:31,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states and 5814 transitions. [2024-02-09 23:25:31,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1111. [2024-02-09 23:25:31,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1111 states have (on average 2.647164716471647) internal successors, (2941), 1110 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:31,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 2941 transitions. [2024-02-09 23:25:31,586 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1111 states and 2941 transitions. [2024-02-09 23:25:31,586 INFO L428 stractBuchiCegarLoop]: Abstraction has 1111 states and 2941 transitions. [2024-02-09 23:25:31,586 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-02-09 23:25:31,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1111 states and 2941 transitions. [2024-02-09 23:25:31,592 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2024-02-09 23:25:31,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:31,592 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:31,593 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:31,593 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:31,593 INFO L748 eck$LassoCheckResult]: Stem: 15301#[$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[] 14655#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 14657#[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] 15461#[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] 15817#[ULTIMATE.startFINAL, L53, L38]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] 16231#[ULTIMATE.startFINAL, L38, 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] 16219#[L67, ULTIMATE.startFINAL, L38]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] 16215#[ULTIMATE.startFINAL, L38, L68-1]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] 15045#[ULTIMATE.startFINAL, L54-1, L38]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] 15277#[ULTIMATE.startFINAL, L55, L38]don't care [115] L55-->L56: Formula: (<= |v_workerThread1of1ForFork1_sz#1_3| 0) InVars {workerThread1of1ForFork1_sz#1=|v_workerThread1of1ForFork1_sz#1_3|} OutVars{workerThread1of1ForFork1_sz#1=|v_workerThread1of1ForFork1_sz#1_3|} AuxVars[] AssignedVars[] 14545#[L56, ULTIMATE.startFINAL, L38]don't care [2024-02-09 23:25:31,593 INFO L750 eck$LassoCheckResult]: Loop: 14545#[L56, 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] 14547#[L56, ULTIMATE.startFINAL, L39]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] 14967#[L56, ULTIMATE.startFINAL, L67]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] 15109#[L68-1, L56, 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] 15111#[L56, ULTIMATE.startFINAL, L39-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] 14527#[L40, ULTIMATE.startFINAL, L56]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[] 14529#[L56, 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[] 14595#[L56, ULTIMATE.startFINAL, L44]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] 14545#[L56, ULTIMATE.startFINAL, L38]don't care [2024-02-09 23:25:31,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:31,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1549848708, now seen corresponding path program 1 times [2024-02-09 23:25:31,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:31,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839058685] [2024-02-09 23:25:31,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:31,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:31,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:31,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:31,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:31,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2033960711, now seen corresponding path program 2 times [2024-02-09 23:25:31,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:31,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958397] [2024-02-09 23:25:31,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:31,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:31,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:31,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:31,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:31,632 INFO L85 PathProgramCache]: Analyzing trace with hash -618837118, now seen corresponding path program 1 times [2024-02-09 23:25:31,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:31,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303311695] [2024-02-09 23:25:31,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:31,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:31,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:31,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-09 23:25:31,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303311695] [2024-02-09 23:25:31,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303311695] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-09 23:25:31,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-09 23:25:31,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-09 23:25:31,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252202355] [2024-02-09 23:25:31,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-09 23:25:31,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-09 23:25:31,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-09 23:25:31,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-02-09 23:25:31,829 INFO L87 Difference]: Start difference. First operand 1111 states and 2941 transitions. cyclomatic complexity: 1881 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:31,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-02-09 23:25:31,893 INFO L93 Difference]: Finished difference Result 1871 states and 4864 transitions. [2024-02-09 23:25:31,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1871 states and 4864 transitions. [2024-02-09 23:25:31,905 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 400 [2024-02-09 23:25:31,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1871 states to 1839 states and 4766 transitions. [2024-02-09 23:25:31,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1155 [2024-02-09 23:25:31,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1155 [2024-02-09 23:25:31,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1839 states and 4766 transitions. [2024-02-09 23:25:31,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:31,919 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1839 states and 4766 transitions. [2024-02-09 23:25:31,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states and 4766 transitions. [2024-02-09 23:25:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1220. [2024-02-09 23:25:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 1220 states have (on average 2.6475409836065573) internal successors, (3230), 1219 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 3230 transitions. [2024-02-09 23:25:31,948 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1220 states and 3230 transitions. [2024-02-09 23:25:31,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-09 23:25:31,949 INFO L428 stractBuchiCegarLoop]: Abstraction has 1220 states and 3230 transitions. [2024-02-09 23:25:31,949 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-02-09 23:25:31,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1220 states and 3230 transitions. [2024-02-09 23:25:31,955 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 256 [2024-02-09 23:25:31,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:31,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:31,956 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:31,956 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:31,956 INFO L748 eck$LassoCheckResult]: Stem: 19416#[$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[] 18758#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 18760#[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] 19610#[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] 19518#[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] 19520#[L67, 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] 20166#[ULTIMATE.startFINAL, L53, L67]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] 20766#[ULTIMATE.startFINAL, L67, 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] 20768#[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] 20894#[ULTIMATE.startFINAL, L67, L68-1]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] 20966#[ULTIMATE.startFINAL, L67, L54-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] 19872#[L68-1, ULTIMATE.startFINAL, L54-1]don't care [2024-02-09 23:25:31,957 INFO L750 eck$LassoCheckResult]: Loop: 19872#[L68-1, ULTIMATE.startFINAL, L54-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] 19876#[ULTIMATE.startFINAL, L39-1, L54-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] 19884#[L40, ULTIMATE.startFINAL, L54-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[] 19924#[L43, ULTIMATE.startFINAL, L54-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[] 20578#[ULTIMATE.startFINAL, L54-1, L44]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] 19858#[ULTIMATE.startFINAL, L54-1, 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] 19860#[ULTIMATE.startFINAL, L54-1, L39]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] 20888#[ULTIMATE.startFINAL, L67, L54-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] 19872#[L68-1, ULTIMATE.startFINAL, L54-1]don't care [2024-02-09 23:25:31,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:31,957 INFO L85 PathProgramCache]: Analyzing trace with hash 2052169035, now seen corresponding path program 1 times [2024-02-09 23:25:31,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:31,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732672909] [2024-02-09 23:25:31,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:31,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:31,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:31,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:31,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:31,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1532400443, now seen corresponding path program 3 times [2024-02-09 23:25:31,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:31,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975663881] [2024-02-09 23:25:31,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:31,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:31,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:31,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:31,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:31,978 INFO L85 PathProgramCache]: Analyzing trace with hash -930920827, now seen corresponding path program 1 times [2024-02-09 23:25:31,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:31,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627395428] [2024-02-09 23:25:31,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:31,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:31,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:31,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:32,347 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:25:32,347 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:25:32,347 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:25:32,347 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:25:32,347 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:25:32,347 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:32,347 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:25:32,347 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:25:32,347 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration7_Lasso [2024-02-09 23:25:32,347 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:25:32,347 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:25:32,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:32,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:32,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:32,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:32,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:32,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:32,816 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-02-09 23:25:33,158 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:25:33,158 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:25:33,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:33,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:33,159 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:33,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-02-09 23:25:33,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:33,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:33,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:33,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:33,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:33,173 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:33,173 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:33,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:33,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:33,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:33,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:33,200 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:33,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:33,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:33,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:33,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:33,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:33,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:33,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:33,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-02-09 23:25:33,228 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:33,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:33,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:33,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:33,233 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:33,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-02-09 23:25:33,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:33,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:33,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:33,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:33,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:33,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:33,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:33,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:33,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-02-09 23:25:33,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:33,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:33,249 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:33,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-02-09 23:25:33,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:33,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:33,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:33,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:33,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:33,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:33,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:33,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:33,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:33,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-02-09 23:25:33,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:33,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:33,263 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:33,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-02-09 23:25:33,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:33,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:33,273 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:25:33,273 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:25:33,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:33,298 INFO L401 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2024-02-09 23:25:33,298 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:25:33,336 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:25:33,389 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2024-02-09 23:25:33,389 INFO L444 ModelExtractionUtils]: 38 out of 56 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-02-09 23:25:33,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:33,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:33,390 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:33,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-02-09 23:25:33,392 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:25:33,400 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:25:33,400 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:25:33,400 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 [3*N - 2*cnt >= 0] [2024-02-09 23:25:33,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-02-09 23:25:33,408 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:25:33,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:33,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:25:33,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:33,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:25:33,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:33,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:33,665 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 4 loop predicates [2024-02-09 23:25:33,665 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1220 states and 3230 transitions. cyclomatic complexity: 2067 Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-09 23:25:33,920 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1220 states and 3230 transitions. cyclomatic complexity: 2067. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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 3021 states and 7610 transitions. Complement of second has 18 states. [2024-02-09 23:25:33,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 5 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:25:33,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-09 23:25:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 125 transitions. [2024-02-09 23:25:33,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 125 transitions. Stem has 11 letters. Loop has 8 letters. [2024-02-09 23:25:33,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:33,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 125 transitions. Stem has 19 letters. Loop has 8 letters. [2024-02-09 23:25:33,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:33,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 125 transitions. Stem has 11 letters. Loop has 16 letters. [2024-02-09 23:25:33,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:33,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3021 states and 7610 transitions. [2024-02-09 23:25:33,943 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2024-02-09 23:25:33,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3021 states to 2401 states and 6074 transitions. [2024-02-09 23:25:33,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1175 [2024-02-09 23:25:33,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1314 [2024-02-09 23:25:33,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2401 states and 6074 transitions. [2024-02-09 23:25:33,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:33,959 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2401 states and 6074 transitions. [2024-02-09 23:25:33,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states and 6074 transitions. [2024-02-09 23:25:33,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 1517. [2024-02-09 23:25:33,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1517 states have (on average 2.6341463414634148) internal successors, (3996), 1516 states have internal predecessors, (3996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 3996 transitions. [2024-02-09 23:25:33,995 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1517 states and 3996 transitions. [2024-02-09 23:25:33,995 INFO L428 stractBuchiCegarLoop]: Abstraction has 1517 states and 3996 transitions. [2024-02-09 23:25:33,995 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-02-09 23:25:33,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1517 states and 3996 transitions. [2024-02-09 23:25:34,003 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2024-02-09 23:25:34,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:34,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:34,003 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:34,003 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:34,004 INFO L748 eck$LassoCheckResult]: Stem: 25043#[$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[] 24351#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 24353#[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] 24611#[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] 24615#[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] 25275#[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] 25245#[L68-1, 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] 25247#[L68-1, 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] 26239#[L68-1, 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] 26891#[L68-1, L67, ULTIMATE.startFINAL]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] 25195#[L68-1, ULTIMATE.startFINAL, L68-1]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] 24193#[L68-1, ULTIMATE.startFINAL, L54-1]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] 24195#[L68-1, ULTIMATE.startFINAL, L55]don't care [115] L55-->L56: Formula: (<= |v_workerThread1of1ForFork1_sz#1_3| 0) InVars {workerThread1of1ForFork1_sz#1=|v_workerThread1of1ForFork1_sz#1_3|} OutVars{workerThread1of1ForFork1_sz#1=|v_workerThread1of1ForFork1_sz#1_3|} AuxVars[] AssignedVars[] 24825#[L68-1, L56, ULTIMATE.startFINAL]don't care [2024-02-09 23:25:34,004 INFO L750 eck$LassoCheckResult]: Loop: 24825#[L68-1, L56, 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] 24827#[L56, ULTIMATE.startFINAL, L39-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] 24215#[L40, ULTIMATE.startFINAL, L56]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[] 24217#[L56, 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[] 24927#[L56, ULTIMATE.startFINAL, L44]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] 24233#[L56, 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] 24235#[L56, ULTIMATE.startFINAL, L39]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] 25083#[L56, ULTIMATE.startFINAL, L67]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] 24825#[L68-1, L56, ULTIMATE.startFINAL]don't care [2024-02-09 23:25:34,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:34,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1172250590, now seen corresponding path program 1 times [2024-02-09 23:25:34,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:34,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548506657] [2024-02-09 23:25:34,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:34,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:34,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:34,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:34,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:34,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1532400443, now seen corresponding path program 4 times [2024-02-09 23:25:34,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:34,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083882049] [2024-02-09 23:25:34,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:34,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:34,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:34,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:34,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:34,019 INFO L85 PathProgramCache]: Analyzing trace with hash -211172772, now seen corresponding path program 2 times [2024-02-09 23:25:34,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:34,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265088458] [2024-02-09 23:25:34,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:34,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:34,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:34,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:34,293 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:25:34,293 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:25:34,293 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:25:34,293 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:25:34,293 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:25:34,293 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:34,293 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:25:34,293 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:25:34,293 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration8_Lasso [2024-02-09 23:25:34,293 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:25:34,293 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:25:34,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:34,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:34,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:34,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:34,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:34,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:34,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:34,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:34,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:34,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:34,795 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:25:34,795 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:25:34,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:34,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:34,796 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:34,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-02-09 23:25:34,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:34,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:34,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:34,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:34,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:34,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:34,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:34,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:34,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-02-09 23:25:34,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:34,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:34,828 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:34,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-02-09 23:25:34,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:34,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:34,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:34,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:34,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:34,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:34,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:34,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:34,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:34,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-02-09 23:25:34,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:34,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:34,841 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:34,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-02-09 23:25:34,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:34,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:34,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:34,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:34,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:34,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:34,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:34,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:34,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:34,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-02-09 23:25:34,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:34,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:34,854 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:34,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-02-09 23:25:34,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:34,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:34,863 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-02-09 23:25:34,863 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:25:34,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:34,881 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2024-02-09 23:25:34,881 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:25:34,920 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:25:34,962 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-02-09 23:25:34,962 INFO L444 ModelExtractionUtils]: 16 out of 36 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-02-09 23:25:34,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:34,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:34,964 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:34,972 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:25:34,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-02-09 23:25:35,001 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:25:35,002 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:25:35,002 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerWithAssertThread1of1ForFork0_steal_num#1) = 1*workerWithAssertThread1of1ForFork0_steal_num#1 Supporting invariants [-1*N + 1*cnt >= 0] [2024-02-09 23:25:35,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:35,013 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:25:35,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:35,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-09 23:25:35,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:35,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-09 23:25:35,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:35,196 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2024-02-09 23:25:35,196 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1517 states and 3996 transitions. cyclomatic complexity: 2546 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:35,453 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1517 states and 3996 transitions. cyclomatic complexity: 2546. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 1887 states and 4878 transitions. Complement of second has 16 states. [2024-02-09 23:25:35,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 6 stem states 4 non-accepting loop states 1 accepting loop states [2024-02-09 23:25:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-02-09 23:25:35,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 118 transitions. Stem has 13 letters. Loop has 8 letters. [2024-02-09 23:25:35,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:35,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 118 transitions. Stem has 21 letters. Loop has 8 letters. [2024-02-09 23:25:35,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:35,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 118 transitions. Stem has 13 letters. Loop has 16 letters. [2024-02-09 23:25:35,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:35,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1887 states and 4878 transitions. [2024-02-09 23:25:35,468 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 256 [2024-02-09 23:25:35,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1887 states to 1789 states and 4648 transitions. [2024-02-09 23:25:35,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1094 [2024-02-09 23:25:35,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1124 [2024-02-09 23:25:35,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1789 states and 4648 transitions. [2024-02-09 23:25:35,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:35,485 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1789 states and 4648 transitions. [2024-02-09 23:25:35,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states and 4648 transitions. [2024-02-09 23:25:35,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1517. [2024-02-09 23:25:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1517 states have (on average 2.6301911667765325) internal successors, (3990), 1516 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:35,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 3990 transitions. [2024-02-09 23:25:35,517 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1517 states and 3990 transitions. [2024-02-09 23:25:35,517 INFO L428 stractBuchiCegarLoop]: Abstraction has 1517 states and 3990 transitions. [2024-02-09 23:25:35,518 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-02-09 23:25:35,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1517 states and 3990 transitions. [2024-02-09 23:25:35,523 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2024-02-09 23:25:35,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:35,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:35,524 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:35,524 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:35,525 INFO L748 eck$LassoCheckResult]: Stem: 30054#[$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[] 29378#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 29380#[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] 30246#[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] 30428#[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] 30400#[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] 30282#[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] 29726#[L39-1, 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] 29728#[ULTIMATE.startFINAL, L53, L39-1]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] 31934#[ULTIMATE.startFINAL, L39-1, 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] 32000#[L67, ULTIMATE.startFINAL, L39-1]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] 31902#[ULTIMATE.startFINAL, L39-1, L68-1]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] 31894#[ULTIMATE.startFINAL, L39-1, L54-1]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] 30220#[L55, ULTIMATE.startFINAL, L39-1]don't care [115] L55-->L56: Formula: (<= |v_workerThread1of1ForFork1_sz#1_3| 0) InVars {workerThread1of1ForFork1_sz#1=|v_workerThread1of1ForFork1_sz#1_3|} OutVars{workerThread1of1ForFork1_sz#1=|v_workerThread1of1ForFork1_sz#1_3|} AuxVars[] AssignedVars[] 29842#[L56, ULTIMATE.startFINAL, L39-1]don't care [2024-02-09 23:25:35,525 INFO L750 eck$LassoCheckResult]: Loop: 29842#[L56, ULTIMATE.startFINAL, L39-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] 29252#[L40, ULTIMATE.startFINAL, L56]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[] 29254#[L56, 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[] 29940#[L56, ULTIMATE.startFINAL, L44]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] 29276#[L56, 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] 29278#[L56, ULTIMATE.startFINAL, L39]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] 30108#[L56, ULTIMATE.startFINAL, L67]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] 29840#[L68-1, L56, 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] 29842#[L56, ULTIMATE.startFINAL, L39-1]don't care [2024-02-09 23:25:35,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:35,528 INFO L85 PathProgramCache]: Analyzing trace with hash 2141026329, now seen corresponding path program 1 times [2024-02-09 23:25:35,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:35,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182002713] [2024-02-09 23:25:35,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:35,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:35,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:35,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:35,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:35,552 INFO L85 PathProgramCache]: Analyzing trace with hash 813106951, now seen corresponding path program 5 times [2024-02-09 23:25:35,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:35,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907693787] [2024-02-09 23:25:35,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:35,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:35,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:35,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:35,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:35,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1115232481, now seen corresponding path program 3 times [2024-02-09 23:25:35,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:35,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573519722] [2024-02-09 23:25:35,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:35,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:35,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:35,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:35,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:35,867 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:25:35,867 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:25:35,867 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:25:35,867 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:25:35,867 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:25:35,867 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:35,867 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:25:35,867 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:25:35,867 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration9_Lasso [2024-02-09 23:25:35,867 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:25:35,867 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:25:35,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:35,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:35,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:35,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25: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-09 23:25:36,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:36,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:36,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:36,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:36,400 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:25:36,400 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:25:36,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:36,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:36,402 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:36,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-02-09 23:25:36,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:36,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:36,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:36,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:36,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:36,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:36,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:36,414 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:36,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-02-09 23:25:36,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:36,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:36,417 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:36,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-02-09 23:25:36,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:36,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:36,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:36,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:36,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:36,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:36,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:36,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:36,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:36,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:36,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:36,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:36,431 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:36,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-02-09 23:25:36,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:36,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:36,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:36,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:36,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:36,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:36,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:36,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:36,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-02-09 23:25:36,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:36,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:36,447 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:36,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-02-09 23:25:36,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:36,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:36,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:36,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:36,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:36,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:36,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:36,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:36,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:36,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:36,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:36,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:36,460 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:36,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-02-09 23:25:36,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:36,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:36,471 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-02-09 23:25:36,471 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:25:36,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:36,488 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2024-02-09 23:25:36,488 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:25:36,528 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:25:36,577 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2024-02-09 23:25:36,577 INFO L444 ModelExtractionUtils]: 17 out of 36 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-02-09 23:25:36,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:36,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:36,580 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:36,588 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:25:36,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-02-09 23:25:36,598 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:25:36,598 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:25:36,598 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerWithAssertThread1of1ForFork0_sz#1, N, cnt) = 1*workerWithAssertThread1of1ForFork0_sz#1 + 1*N - 1*cnt Supporting invariants [1*N - 1*cnt >= 0] [2024-02-09 23:25:36,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:36,604 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:25:36,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:36,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:25:36,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:36,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-09 23:25:36,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:36,947 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2024-02-09 23:25:36,947 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1517 states and 3990 transitions. cyclomatic complexity: 2540 Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:37,153 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1517 states and 3990 transitions. cyclomatic complexity: 2540. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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 2367 states and 6069 transitions. Complement of second has 15 states. [2024-02-09 23:25:37,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 3 non-accepting loop states 1 accepting loop states [2024-02-09 23:25:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-02-09 23:25:37,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 118 transitions. Stem has 14 letters. Loop has 8 letters. [2024-02-09 23:25:37,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:37,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 118 transitions. Stem has 22 letters. Loop has 8 letters. [2024-02-09 23:25:37,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:37,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 118 transitions. Stem has 14 letters. Loop has 16 letters. [2024-02-09 23:25:37,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:37,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2367 states and 6069 transitions. [2024-02-09 23:25:37,168 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2024-02-09 23:25:37,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2367 states to 2272 states and 5832 transitions. [2024-02-09 23:25:37,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1424 [2024-02-09 23:25:37,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1445 [2024-02-09 23:25:37,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2272 states and 5832 transitions. [2024-02-09 23:25:37,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:37,184 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2272 states and 5832 transitions. [2024-02-09 23:25:37,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states and 5832 transitions. [2024-02-09 23:25:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1517. [2024-02-09 23:25:37,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1517 states have (on average 2.6222808174027685) internal successors, (3978), 1516 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 3978 transitions. [2024-02-09 23:25:37,240 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1517 states and 3978 transitions. [2024-02-09 23:25:37,240 INFO L428 stractBuchiCegarLoop]: Abstraction has 1517 states and 3978 transitions. [2024-02-09 23:25:37,240 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-02-09 23:25:37,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1517 states and 3978 transitions. [2024-02-09 23:25:37,245 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2024-02-09 23:25:37,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:37,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:37,245 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:37,246 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:37,246 INFO L748 eck$LassoCheckResult]: Stem: 35580#[$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[] 34912#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 34914#[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] 35170#[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] 35172#[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] 35834#[L67, 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] 35836#[ULTIMATE.startFINAL, L53, L67]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] 35972#[ULTIMATE.startFINAL, L67, 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] 35954#[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] 35956#[ULTIMATE.startFINAL, L67, L68-1]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] 36056#[ULTIMATE.startFINAL, L67, L54-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] 36164#[L68-1, ULTIMATE.startFINAL, L54-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] 34762#[ULTIMATE.startFINAL, L39-1, L54-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] 35930#[L40, ULTIMATE.startFINAL, L54-1]don't care [103] L40-->L41: Formula: (<= |v_workerWithAssertThread1of1ForFork0_sz#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_3|} OutVars{workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_3|} AuxVars[] AssignedVars[] 35626#[ULTIMATE.startFINAL, L54-1, L41]don't care [2024-02-09 23:25:37,246 INFO L750 eck$LassoCheckResult]: Loop: 35626#[ULTIMATE.startFINAL, L54-1, L41]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] 35406#[ULTIMATE.startFINAL, L55, L41]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[] 35238#[ULTIMATE.startFINAL, L58, L41]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[] 35240#[ULTIMATE.startFINAL, L41, L59]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] 35016#[ULTIMATE.startFINAL, L53, L41]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] 35020#[ULTIMATE.startFINAL, L41, 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] 35362#[L67, ULTIMATE.startFINAL, L41]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] 35396#[ULTIMATE.startFINAL, L41, L68-1]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] 35626#[ULTIMATE.startFINAL, L54-1, L41]don't care [2024-02-09 23:25:37,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:37,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:37,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1603330747, now seen corresponding path program 1 times [2024-02-09 23:25:37,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:37,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995899165] [2024-02-09 23:25:37,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:37,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:37,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:37,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:37,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:37,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1657414425, now seen corresponding path program 5 times [2024-02-09 23:25:37,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:37,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868692655] [2024-02-09 23:25:37,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:37,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:37,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:37,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:37,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:37,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1870830175, now seen corresponding path program 2 times [2024-02-09 23:25:37,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:37,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244776550] [2024-02-09 23:25:37,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:37,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:37,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:37,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:37,571 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:25:37,571 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:25:37,571 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:25:37,571 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:25:37,571 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:25:37,571 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:37,571 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:25:37,572 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:25:37,572 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration10_Lasso [2024-02-09 23:25:37,572 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:25:37,572 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:25:37,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:37,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:37,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:37,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:37,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:37,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:37,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:37,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:37,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:38,023 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:25:38,023 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:25:38,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:38,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:38,028 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:38,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-02-09 23:25:38,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:38,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:38,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:38,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:38,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:38,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:38,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:38,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:38,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:38,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:38,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:38,044 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:38,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-02-09 23:25:38,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:38,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:38,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:38,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:38,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:38,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:38,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:38,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:38,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-02-09 23:25:38,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:38,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:38,071 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:38,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-02-09 23:25:38,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:38,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:38,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:38,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:38,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:38,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:38,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:38,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:38,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-02-09 23:25:38,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:38,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:38,087 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:38,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-02-09 23:25:38,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:38,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:38,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:38,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:38,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:38,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:38,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:38,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:38,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-02-09 23:25:38,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:38,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:38,103 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:38,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-02-09 23:25:38,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:38,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:38,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:38,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:38,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:38,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:38,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:38,118 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:38,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-02-09 23:25:38,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:38,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:38,122 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:38,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-02-09 23:25:38,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:38,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:38,130 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-02-09 23:25:38,130 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:25:38,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:38,147 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2024-02-09 23:25:38,147 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:25:38,188 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:25:38,238 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2024-02-09 23:25:38,238 INFO L444 ModelExtractionUtils]: 17 out of 36 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-02-09 23:25:38,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:38,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:38,240 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:38,250 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:25:38,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-02-09 23:25:38,267 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:25:38,267 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:25:38,267 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerThread1of1ForFork1_sz#1, cnt, N) = 2*workerThread1of1ForFork1_sz#1 - 2*cnt + 3*N Supporting invariants [-2*cnt + 3*N >= 0] [2024-02-09 23:25:38,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:38,279 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:25:38,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:38,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-09 23:25:38,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:38,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-02-09 23:25:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:38,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:25:38,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:38,741 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-09 23:25:38,741 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1517 states and 3978 transitions. cyclomatic complexity: 2528 Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:39,134 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1517 states and 3978 transitions. cyclomatic complexity: 2528. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 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 2022 states and 5093 transitions. Complement of second has 20 states. [2024-02-09 23:25:39,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 9 stem states 4 non-accepting loop states 2 accepting loop states [2024-02-09 23:25:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:39,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 128 transitions. [2024-02-09 23:25:39,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 128 transitions. Stem has 14 letters. Loop has 8 letters. [2024-02-09 23:25:39,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:39,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 128 transitions. Stem has 22 letters. Loop has 8 letters. [2024-02-09 23:25:39,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:39,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 128 transitions. Stem has 14 letters. Loop has 16 letters. [2024-02-09 23:25:39,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:39,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2022 states and 5093 transitions. [2024-02-09 23:25:39,146 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2024-02-09 23:25:39,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2022 states to 1924 states and 4863 transitions. [2024-02-09 23:25:39,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1083 [2024-02-09 23:25:39,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1137 [2024-02-09 23:25:39,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1924 states and 4863 transitions. [2024-02-09 23:25:39,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:39,160 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1924 states and 4863 transitions. [2024-02-09 23:25:39,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states and 4863 transitions. [2024-02-09 23:25:39,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1517. [2024-02-09 23:25:39,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1517 states have (on average 2.619644034278181) internal successors, (3974), 1516 states have internal predecessors, (3974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 3974 transitions. [2024-02-09 23:25:39,196 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1517 states and 3974 transitions. [2024-02-09 23:25:39,196 INFO L428 stractBuchiCegarLoop]: Abstraction has 1517 states and 3974 transitions. [2024-02-09 23:25:39,196 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-02-09 23:25:39,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1517 states and 3974 transitions. [2024-02-09 23:25:39,202 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2024-02-09 23:25:39,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:39,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:39,202 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:39,202 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:39,203 INFO L748 eck$LassoCheckResult]: Stem: 40803#[$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[] 40101#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 40103#[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] 41033#[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] 41193#[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] 41181#[L67, 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] 41183#[ULTIMATE.startFINAL, L53, L67]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] 41591#[ULTIMATE.startFINAL, L67, 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] 41575#[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] 41577#[ULTIMATE.startFINAL, L67, L68-1]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] 41861#[ULTIMATE.startFINAL, L67, L54-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] 42509#[L68-1, ULTIMATE.startFINAL, L54-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] 41755#[ULTIMATE.startFINAL, L39-1, L54-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] 41745#[L40, ULTIMATE.startFINAL, L54-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[] 41075#[L43, ULTIMATE.startFINAL, L54-1]don't care [105] L43-->workerWithAssertErr0ASSERT_VIOLATIONASSERT: Formula: (or (<= v_N_4 |v_workerWithAssertThread1of1ForFork0_i#1_3|) (< |v_workerWithAssertThread1of1ForFork0_i#1_3| 0)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_3|, N=v_N_4} AuxVars[] AssignedVars[] 40431#[ULTIMATE.startFINAL, workerWithAssertErr0ASSERT_VIOLATIONASSERT, L54-1]don't care [2024-02-09 23:25:39,203 INFO L750 eck$LassoCheckResult]: Loop: 40431#[ULTIMATE.startFINAL, workerWithAssertErr0ASSERT_VIOLATIONASSERT, L54-1]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] 40207#[L55, ULTIMATE.startFINAL, workerWithAssertErr0ASSERT_VIOLATIONASSERT]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[] 40209#[ULTIMATE.startFINAL, workerWithAssertErr0ASSERT_VIOLATIONASSERT, 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[] 40759#[ULTIMATE.startFINAL, workerWithAssertErr0ASSERT_VIOLATIONASSERT, L59]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] 40817#[ULTIMATE.startFINAL, L53, workerWithAssertErr0ASSERT_VIOLATIONASSERT]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] 40575#[ULTIMATE.startFINAL, workerWithAssertErr0ASSERT_VIOLATIONASSERT, 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] 40223#[L67, ULTIMATE.startFINAL, workerWithAssertErr0ASSERT_VIOLATIONASSERT]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] 40225#[ULTIMATE.startFINAL, workerWithAssertErr0ASSERT_VIOLATIONASSERT, L68-1]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] 40431#[ULTIMATE.startFINAL, workerWithAssertErr0ASSERT_VIOLATIONASSERT, L54-1]don't care [2024-02-09 23:25:39,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:39,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1836354259, now seen corresponding path program 1 times [2024-02-09 23:25:39,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:39,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44881837] [2024-02-09 23:25:39,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:39,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:39,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-09 23:25:39,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44881837] [2024-02-09 23:25:39,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44881837] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-09 23:25:39,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-09 23:25:39,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-09 23:25:39,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784501072] [2024-02-09 23:25:39,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-09 23:25:39,347 INFO L753 eck$LassoCheckResult]: stem already infeasible [2024-02-09 23:25:39,348 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:39,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1657414425, now seen corresponding path program 6 times [2024-02-09 23:25:39,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:39,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429202229] [2024-02-09 23:25:39,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:39,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:39,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:39,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:39,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-09 23:25:39,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-09 23:25:39,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-02-09 23:25:39,458 INFO L87 Difference]: Start difference. First operand 1517 states and 3974 transitions. cyclomatic complexity: 2524 Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:39,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-02-09 23:25:39,607 INFO L93 Difference]: Finished difference Result 2531 states and 6537 transitions. [2024-02-09 23:25:39,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2531 states and 6537 transitions. [2024-02-09 23:25:39,619 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 448 [2024-02-09 23:25:39,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2531 states to 2531 states and 6537 transitions. [2024-02-09 23:25:39,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1564 [2024-02-09 23:25:39,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1564 [2024-02-09 23:25:39,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2531 states and 6537 transitions. [2024-02-09 23:25:39,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:39,632 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2531 states and 6537 transitions. [2024-02-09 23:25:39,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states and 6537 transitions. [2024-02-09 23:25:39,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 1788. [2024-02-09 23:25:39,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1788 states have (on average 2.614653243847875) internal successors, (4675), 1787 states have internal predecessors, (4675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 4675 transitions. [2024-02-09 23:25:39,669 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1788 states and 4675 transitions. [2024-02-09 23:25:39,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-09 23:25:39,670 INFO L428 stractBuchiCegarLoop]: Abstraction has 1788 states and 4675 transitions. [2024-02-09 23:25:39,670 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-02-09 23:25:39,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1788 states and 4675 transitions. [2024-02-09 23:25:39,701 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 272 [2024-02-09 23:25:39,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:39,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:39,703 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:39,703 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:39,703 INFO L748 eck$LassoCheckResult]: Stem: 46347#[$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[] 45685#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 45687#[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] 45947#[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] 45949#[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] 46835#[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] 46593#[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] 46043#[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] 46045#[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[] 45931#[L43, 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] 45935#[ULTIMATE.startFINAL, L43, 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] 48295#[L43, 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] 45909#[L67, L43, ULTIMATE.startFINAL]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] 45911#[L43, ULTIMATE.startFINAL, L68-1]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] 46355#[L43, ULTIMATE.startFINAL, L54-1]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] 45659#[L43, ULTIMATE.startFINAL, L55]don't care [115] L55-->L56: Formula: (<= |v_workerThread1of1ForFork1_sz#1_3| 0) InVars {workerThread1of1ForFork1_sz#1=|v_workerThread1of1ForFork1_sz#1_3|} OutVars{workerThread1of1ForFork1_sz#1=|v_workerThread1of1ForFork1_sz#1_3|} AuxVars[] AssignedVars[] 45559#[L56, L43, ULTIMATE.startFINAL]don't care [2024-02-09 23:25:39,705 INFO L750 eck$LassoCheckResult]: Loop: 45559#[L56, 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[] 46243#[L56, ULTIMATE.startFINAL, L44]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] 45575#[L56, 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] 45577#[L56, ULTIMATE.startFINAL, L39]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] 46401#[L56, ULTIMATE.startFINAL, L67]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] 46153#[L68-1, L56, 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] 46155#[L56, ULTIMATE.startFINAL, L39-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] 45557#[L40, ULTIMATE.startFINAL, L56]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[] 45559#[L56, L43, ULTIMATE.startFINAL]don't care [2024-02-09 23:25:39,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:39,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1907209513, now seen corresponding path program 1 times [2024-02-09 23:25:39,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:39,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494129788] [2024-02-09 23:25:39,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:39,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:39,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:39,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:39,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:39,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1562443655, now seen corresponding path program 6 times [2024-02-09 23:25:39,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:39,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941437040] [2024-02-09 23:25:39,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:39,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:39,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:39,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:39,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:39,732 INFO L85 PathProgramCache]: Analyzing trace with hash 851317853, now seen corresponding path program 4 times [2024-02-09 23:25:39,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:39,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660133934] [2024-02-09 23:25:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:39,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:39,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-09 23:25:39,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660133934] [2024-02-09 23:25:39,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660133934] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-09 23:25:39,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-09 23:25:39,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-09 23:25:39,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152711643] [2024-02-09 23:25:39,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-09 23:25:39,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-09 23:25:39,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-09 23:25:39,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-02-09 23:25:39,942 INFO L87 Difference]: Start difference. First operand 1788 states and 4675 transitions. cyclomatic complexity: 2968 Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-02-09 23:25:40,143 INFO L93 Difference]: Finished difference Result 2036 states and 5277 transitions. [2024-02-09 23:25:40,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2036 states and 5277 transitions. [2024-02-09 23:25:40,154 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 320 [2024-02-09 23:25:40,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2036 states to 2004 states and 5179 transitions. [2024-02-09 23:25:40,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1276 [2024-02-09 23:25:40,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1276 [2024-02-09 23:25:40,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2004 states and 5179 transitions. [2024-02-09 23:25:40,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:40,166 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2004 states and 5179 transitions. [2024-02-09 23:25:40,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states and 5179 transitions. [2024-02-09 23:25:40,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1788. [2024-02-09 23:25:40,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1788 states have (on average 2.593400447427293) internal successors, (4637), 1787 states have internal predecessors, (4637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 4637 transitions. [2024-02-09 23:25:40,198 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1788 states and 4637 transitions. [2024-02-09 23:25:40,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-09 23:25:40,198 INFO L428 stractBuchiCegarLoop]: Abstraction has 1788 states and 4637 transitions. [2024-02-09 23:25:40,198 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-02-09 23:25:40,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1788 states and 4637 transitions. [2024-02-09 23:25:40,204 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 272 [2024-02-09 23:25:40,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:40,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:40,205 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:40,205 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:40,205 INFO L748 eck$LassoCheckResult]: Stem: 52028#[$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[] 51332#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 51334#[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] 51588#[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] 51590#[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] 52366#[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] 52280#[L68-1, 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] 52284#[L68-1, 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] 53714#[L68-1, 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] 53700#[L68-1, L67, ULTIMATE.startFINAL]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] 53548#[L68-1, ULTIMATE.startFINAL, L68-1]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] 53436#[L68-1, ULTIMATE.startFINAL, L54-1]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] 53340#[L68-1, 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[] 51502#[L68-1, 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[] 51506#[L68-1, ULTIMATE.startFINAL, L59]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] 51560#[L68-1, ULTIMATE.startFINAL, L53]don't care [109] L53-->L56: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 51804#[L68-1, L56, ULTIMATE.startFINAL]don't care [2024-02-09 23:25:40,206 INFO L750 eck$LassoCheckResult]: Loop: 51804#[L68-1, L56, 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] 51806#[L56, ULTIMATE.startFINAL, L39-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] 51208#[L40, ULTIMATE.startFINAL, L56]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[] 51210#[L56, 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[] 51898#[L56, ULTIMATE.startFINAL, L44]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] 51226#[L56, 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] 51228#[L56, ULTIMATE.startFINAL, L39]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] 52074#[L56, ULTIMATE.startFINAL, L67]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] 51804#[L68-1, L56, ULTIMATE.startFINAL]don't care [2024-02-09 23:25:40,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:40,206 INFO L85 PathProgramCache]: Analyzing trace with hash -138096919, now seen corresponding path program 1 times [2024-02-09 23:25:40,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:40,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001823163] [2024-02-09 23:25:40,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:40,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:40,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:40,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:40,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1532400443, now seen corresponding path program 7 times [2024-02-09 23:25:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:40,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253164981] [2024-02-09 23:25:40,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:40,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:40,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:40,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:40,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:40,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1099826653, now seen corresponding path program 1 times [2024-02-09 23:25:40,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:40,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419790503] [2024-02-09 23:25:40,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:40,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:40,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:40,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:40,480 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:25:40,481 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:25:40,481 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:25:40,481 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:25:40,481 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:25:40,481 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:40,481 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:25:40,481 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:25:40,481 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration13_Lasso [2024-02-09 23:25:40,481 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:25:40,481 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:25:40,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:40,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:40,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:40,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:40,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:40,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:40,835 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:25:40,835 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:25:40,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:40,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:40,836 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:40,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-02-09 23:25:40,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:40,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:40,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:40,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:40,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:40,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:40,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:40,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:40,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-02-09 23:25:40,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:40,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:40,853 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:40,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-02-09 23:25:40,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:40,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:40,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:40,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:40,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:40,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:40,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:40,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:40,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:40,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:40,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:40,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:40,867 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:40,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-02-09 23:25:40,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:40,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:40,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:40,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:40,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:40,876 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:40,876 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:40,878 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:40,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-02-09 23:25:40,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:40,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:40,881 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:40,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-02-09 23:25:40,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:40,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:40,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:40,890 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:25:40,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:40,901 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-02-09 23:25:40,901 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:25:40,926 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:25:40,953 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-02-09 23:25:40,953 INFO L444 ModelExtractionUtils]: 22 out of 36 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-02-09 23:25:40,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:40,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:40,955 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:40,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-02-09 23:25:40,958 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:25:40,966 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:25:40,966 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:25:40,967 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerWithAssertThread1of1ForFork0_steal_num#1, cnt, N) = 2*workerWithAssertThread1of1ForFork0_steal_num#1 - 2*cnt + 3*N Supporting invariants [3*N - 2*cnt >= 0] [2024-02-09 23:25:40,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:40,973 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:25:40,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:41,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-09 23:25:41,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:41,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:41,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:25:41,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:41,353 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 4 loop predicates [2024-02-09 23:25:41,354 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1788 states and 4637 transitions. cyclomatic complexity: 2930 Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:42,341 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1788 states and 4637 transitions. cyclomatic complexity: 2930. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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 2920 states and 7511 transitions. Complement of second has 24 states. [2024-02-09 23:25:42,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 11 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:25:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 200 transitions. [2024-02-09 23:25:42,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 200 transitions. Stem has 16 letters. Loop has 8 letters. [2024-02-09 23:25:42,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:42,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 200 transitions. Stem has 24 letters. Loop has 8 letters. [2024-02-09 23:25:42,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:42,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 200 transitions. Stem has 16 letters. Loop has 16 letters. [2024-02-09 23:25:42,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:42,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2920 states and 7511 transitions. [2024-02-09 23:25:42,357 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 464 [2024-02-09 23:25:42,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2920 states to 2822 states and 7281 transitions. [2024-02-09 23:25:42,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1761 [2024-02-09 23:25:42,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1819 [2024-02-09 23:25:42,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2822 states and 7281 transitions. [2024-02-09 23:25:42,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:42,370 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2822 states and 7281 transitions. [2024-02-09 23:25:42,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states and 7281 transitions. [2024-02-09 23:25:42,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 1812. [2024-02-09 23:25:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1812 states have (on average 2.5910596026490067) internal successors, (4695), 1811 states have internal predecessors, (4695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 4695 transitions. [2024-02-09 23:25:42,406 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1812 states and 4695 transitions. [2024-02-09 23:25:42,407 INFO L428 stractBuchiCegarLoop]: Abstraction has 1812 states and 4695 transitions. [2024-02-09 23:25:42,407 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-02-09 23:25:42,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1812 states and 4695 transitions. [2024-02-09 23:25:42,412 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 284 [2024-02-09 23:25:42,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:42,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:42,413 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:42,413 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:42,413 INFO L748 eck$LassoCheckResult]: Stem: 58625#[$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[] 57983#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 57985#[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] 58811#[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] 58863#[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] 58855#[L67, 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] 58857#[ULTIMATE.startFINAL, L53, L67]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] 60389#[ULTIMATE.startFINAL, L67, 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] 60371#[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] 60351#[ULTIMATE.startFINAL, L67, L68-1]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] 60333#[ULTIMATE.startFINAL, L67, L54-1]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] 60311#[L55, ULTIMATE.startFINAL, L67]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[] 60285#[ULTIMATE.startFINAL, L67, L58]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] 60267#[L68-1, ULTIMATE.startFINAL, L58]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] 60269#[ULTIMATE.startFINAL, L39-1, L58]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] 60827#[L40, ULTIMATE.startFINAL, L58]don't care [103] L40-->L41: Formula: (<= |v_workerWithAssertThread1of1ForFork0_sz#1_3| 0) InVars {workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_3|} OutVars{workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_3|} AuxVars[] AssignedVars[] 58315#[ULTIMATE.startFINAL, L58, L41]don't care [2024-02-09 23:25:42,413 INFO L750 eck$LassoCheckResult]: Loop: 58315#[ULTIMATE.startFINAL, L58, L41]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[] 58317#[ULTIMATE.startFINAL, L41, L59]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] 58087#[ULTIMATE.startFINAL, L53, L41]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] 58091#[ULTIMATE.startFINAL, L41, 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] 58439#[L67, ULTIMATE.startFINAL, L41]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] 58473#[ULTIMATE.startFINAL, L41, L68-1]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] 58667#[ULTIMATE.startFINAL, L54-1, L41]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] 58483#[ULTIMATE.startFINAL, L55, L41]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[] 58315#[ULTIMATE.startFINAL, L58, L41]don't care [2024-02-09 23:25:42,414 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:42,414 INFO L85 PathProgramCache]: Analyzing trace with hash -677808707, now seen corresponding path program 1 times [2024-02-09 23:25:42,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:42,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107723246] [2024-02-09 23:25:42,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:42,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:42,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:42,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:42,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:42,421 INFO L85 PathProgramCache]: Analyzing trace with hash 786128231, now seen corresponding path program 7 times [2024-02-09 23:25:42,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:42,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812394478] [2024-02-09 23:25:42,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:42,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:42,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:42,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:42,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:42,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2039392477, now seen corresponding path program 3 times [2024-02-09 23:25:42,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:42,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529718139] [2024-02-09 23:25:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:42,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:42,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-09 23:25:42,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529718139] [2024-02-09 23:25:42,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529718139] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-09 23:25:42,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815787558] [2024-02-09 23:25:42,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-09 23:25:42,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-09 23:25:42,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:42,528 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-09 23:25:42,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2024-02-09 23:25:42,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-09 23:25:42,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-09 23:25:42,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-09 23:25:42,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:42,657 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-09 23:25:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:42,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815787558] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-09 23:25:42,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-09 23:25:42,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-02-09 23:25:42,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659536232] [2024-02-09 23:25:42,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-09 23:25:42,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-09 23:25:42,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-09 23:25:42,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-02-09 23:25:42,842 INFO L87 Difference]: Start difference. First operand 1812 states and 4695 transitions. cyclomatic complexity: 2964 Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-02-09 23:25:43,054 INFO L93 Difference]: Finished difference Result 2025 states and 5206 transitions. [2024-02-09 23:25:43,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2025 states and 5206 transitions. [2024-02-09 23:25:43,063 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 284 [2024-02-09 23:25:43,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2025 states to 1981 states and 5068 transitions. [2024-02-09 23:25:43,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1246 [2024-02-09 23:25:43,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1246 [2024-02-09 23:25:43,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1981 states and 5068 transitions. [2024-02-09 23:25:43,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:43,075 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1981 states and 5068 transitions. [2024-02-09 23:25:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states and 5068 transitions. [2024-02-09 23:25:43,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1812. [2024-02-09 23:25:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1812 states have (on average 2.5612582781456954) internal successors, (4641), 1811 states have internal predecessors, (4641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 4641 transitions. [2024-02-09 23:25:43,107 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1812 states and 4641 transitions. [2024-02-09 23:25:43,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-02-09 23:25:43,108 INFO L428 stractBuchiCegarLoop]: Abstraction has 1812 states and 4641 transitions. [2024-02-09 23:25:43,108 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-02-09 23:25:43,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1812 states and 4641 transitions. [2024-02-09 23:25:43,114 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 284 [2024-02-09 23:25:43,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:43,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:43,114 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:43,114 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:43,115 INFO L748 eck$LassoCheckResult]: Stem: 64522#[$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[] 63802#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 63804#[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] 64718#[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] 64910#[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] 64882#[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] 64752#[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] 64754#[L39-1, 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] 64866#[ULTIMATE.startFINAL, L53, L39-1]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] 66482#[ULTIMATE.startFINAL, L39-1, 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] 66472#[L67, ULTIMATE.startFINAL, L39-1]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] 66474#[ULTIMATE.startFINAL, L39-1, L68-1]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] 67076#[ULTIMATE.startFINAL, L39-1, L54-1]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] 64612#[L55, ULTIMATE.startFINAL, L39-1]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[] 65892#[ULTIMATE.startFINAL, L39-1, 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[] 65640#[ULTIMATE.startFINAL, L39-1, L59]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] 65642#[ULTIMATE.startFINAL, L53, L39-1]don't care [109] L53-->L56: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 64286#[L56, ULTIMATE.startFINAL, L39-1]don't care [2024-02-09 23:25:43,115 INFO L750 eck$LassoCheckResult]: Loop: 64286#[L56, ULTIMATE.startFINAL, L39-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] 63672#[L40, ULTIMATE.startFINAL, L56]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[] 63674#[L56, 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[] 64392#[L56, ULTIMATE.startFINAL, L44]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] 63696#[L56, 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] 63698#[L56, ULTIMATE.startFINAL, L39]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] 64562#[L56, ULTIMATE.startFINAL, L67]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] 64284#[L68-1, L56, 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] 64286#[L56, ULTIMATE.startFINAL, L39-1]don't care [2024-02-09 23:25:43,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:43,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1243799662, now seen corresponding path program 1 times [2024-02-09 23:25:43,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:43,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726905443] [2024-02-09 23:25:43,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:43,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:43,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:43,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:43,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:43,129 INFO L85 PathProgramCache]: Analyzing trace with hash 813106951, now seen corresponding path program 8 times [2024-02-09 23:25:43,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:43,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826583794] [2024-02-09 23:25:43,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:43,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:43,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:43,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:43,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:43,138 INFO L85 PathProgramCache]: Analyzing trace with hash -41417320, now seen corresponding path program 2 times [2024-02-09 23:25:43,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:43,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298494380] [2024-02-09 23:25:43,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:43,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:43,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:43,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:43,459 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:25:43,459 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:25:43,459 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:25:43,460 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:25:43,460 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:25:43,460 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:43,460 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:25:43,460 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:25:43,460 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration15_Lasso [2024-02-09 23:25:43,460 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:25:43,460 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:25:43,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:43,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:43,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:43,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:43,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:43,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:43,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:43,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:43,810 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:25:43,810 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:25:43,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:43,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:43,811 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:43,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-02-09 23:25:43,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:43,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:43,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:43,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:43,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:43,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:43,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:43,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:43,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-02-09 23:25:43,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:43,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:43,832 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:43,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-02-09 23:25:43,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:43,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:43,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:43,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:43,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:43,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:43,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:43,845 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:43,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:43,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:43,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:43,849 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:43,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-02-09 23:25:43,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:43,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:43,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:43,858 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:25:43,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:43,871 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-02-09 23:25:43,871 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:25:43,901 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:25:43,936 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2024-02-09 23:25:43,937 INFO L444 ModelExtractionUtils]: 27 out of 46 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-02-09 23:25:43,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:43,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:43,939 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:43,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-02-09 23:25:43,940 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:25:43,948 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:25:43,948 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:25:43,948 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerWithAssertThread1of1ForFork0_sz#1, cnt) = 3*N + 2*workerWithAssertThread1of1ForFork0_sz#1 - 2*cnt Supporting invariants [3*N - 2*cnt >= 0] [2024-02-09 23:25:43,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:43,954 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:25:43,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:43,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-09 23:25:43,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:44,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:44,200 WARN L260 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-09 23:25:44,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:44,391 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 5 loop predicates [2024-02-09 23:25:44,391 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1812 states and 4641 transitions. cyclomatic complexity: 2910 Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:45,493 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1812 states and 4641 transitions. cyclomatic complexity: 2910. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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 2901 states and 7368 transitions. Complement of second has 24 states. [2024-02-09 23:25:45,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 11 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:25:45,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:45,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 188 transitions. [2024-02-09 23:25:45,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 188 transitions. Stem has 17 letters. Loop has 8 letters. [2024-02-09 23:25:45,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:45,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 188 transitions. Stem has 25 letters. Loop has 8 letters. [2024-02-09 23:25:45,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:45,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 188 transitions. Stem has 17 letters. Loop has 16 letters. [2024-02-09 23:25:45,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:45,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2901 states and 7368 transitions. [2024-02-09 23:25:45,507 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 464 [2024-02-09 23:25:45,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2901 states to 2806 states and 7135 transitions. [2024-02-09 23:25:45,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1752 [2024-02-09 23:25:45,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1803 [2024-02-09 23:25:45,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2806 states and 7135 transitions. [2024-02-09 23:25:45,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:45,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2806 states and 7135 transitions. [2024-02-09 23:25:45,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states and 7135 transitions. [2024-02-09 23:25:45,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 1860. [2024-02-09 23:25:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1860 states, 1860 states have (on average 2.55752688172043) internal successors, (4757), 1859 states have internal predecessors, (4757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:45,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 4757 transitions. [2024-02-09 23:25:45,555 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1860 states and 4757 transitions. [2024-02-09 23:25:45,555 INFO L428 stractBuchiCegarLoop]: Abstraction has 1860 states and 4757 transitions. [2024-02-09 23:25:45,555 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-02-09 23:25:45,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1860 states and 4757 transitions. [2024-02-09 23:25:45,561 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 308 [2024-02-09 23:25:45,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:45,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:45,561 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:45,561 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:45,562 INFO L748 eck$LassoCheckResult]: Stem: 71186#[$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[] 70498#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 70500#[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] 71418#[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] 71484#[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] 71476#[L67, 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] 71478#[ULTIMATE.startFINAL, L53, L67]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] 72172#[ULTIMATE.startFINAL, L67, 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] 72150#[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] 72152#[ULTIMATE.startFINAL, L67, L68-1]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] 72264#[ULTIMATE.startFINAL, L67, L54-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] 73100#[L68-1, ULTIMATE.startFINAL, L54-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] 73054#[ULTIMATE.startFINAL, L39-1, L54-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] 73056#[L40, ULTIMATE.startFINAL, L54-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[] 73266#[L43, ULTIMATE.startFINAL, L54-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[] 72980#[ULTIMATE.startFINAL, L54-1, L44]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] 72936#[ULTIMATE.startFINAL, L54-1, L38]don't care [97] L38-->L41: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 71242#[ULTIMATE.startFINAL, L54-1, L41]don't care [2024-02-09 23:25:45,562 INFO L750 eck$LassoCheckResult]: Loop: 71242#[ULTIMATE.startFINAL, L54-1, L41]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] 71008#[ULTIMATE.startFINAL, L55, L41]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[] 70828#[ULTIMATE.startFINAL, L58, L41]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[] 70830#[ULTIMATE.startFINAL, L41, L59]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] 70606#[ULTIMATE.startFINAL, L53, L41]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] 70610#[ULTIMATE.startFINAL, L41, 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] 70962#[L67, ULTIMATE.startFINAL, L41]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] 71000#[ULTIMATE.startFINAL, L41, L68-1]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] 71242#[ULTIMATE.startFINAL, L54-1, L41]don't care [2024-02-09 23:25:45,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:45,563 INFO L85 PathProgramCache]: Analyzing trace with hash 495120132, now seen corresponding path program 1 times [2024-02-09 23:25:45,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:45,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302998484] [2024-02-09 23:25:45,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:45,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:45,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:45,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:45,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:45,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1657414425, now seen corresponding path program 8 times [2024-02-09 23:25:45,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:45,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888434232] [2024-02-09 23:25:45,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:45,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:45,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:45,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:45,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:45,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1188620054, now seen corresponding path program 1 times [2024-02-09 23:25:45,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:45,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509160165] [2024-02-09 23:25:45,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:45,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:45,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:45,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:45,853 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:25:45,854 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:25:45,854 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:25:45,854 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:25:45,854 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:25:45,854 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:45,854 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:25:45,854 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:25:45,854 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration16_Lasso [2024-02-09 23:25:45,854 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:25:45,854 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:25:45,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:45,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:45,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:45,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:45,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:45,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:46,266 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:25:46,267 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:25:46,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:46,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:46,268 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:46,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-02-09 23:25:46,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:46,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:46,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:46,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:46,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:46,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:46,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:46,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:46,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:46,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-02-09 23:25:46,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:46,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:46,282 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:46,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-02-09 23:25:46,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:46,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:46,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:46,290 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:25:46,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:46,303 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-02-09 23:25:46,303 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:25:46,330 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:25:46,361 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-02-09 23:25:46,361 INFO L444 ModelExtractionUtils]: 20 out of 36 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-02-09 23:25:46,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:46,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:46,362 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:46,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-02-09 23:25:46,364 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:25:46,372 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:25:46,372 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:25:46,372 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerThread1of1ForFork1_sz#1, N, cnt) = 2*workerThread1of1ForFork1_sz#1 + 3*N - 2*cnt Supporting invariants [-2*cnt + 3*N >= 0] [2024-02-09 23:25:46,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2024-02-09 23:25:46,378 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:25:46,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:46,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-09 23:25:46,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:46,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:25:46,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:46,756 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 4 loop predicates [2024-02-09 23:25:46,756 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1860 states and 4757 transitions. cyclomatic complexity: 2978 Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:47,557 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1860 states and 4757 transitions. cyclomatic complexity: 2978. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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 2772 states and 6942 transitions. Complement of second has 22 states. [2024-02-09 23:25:47,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 11 stem states 4 non-accepting loop states 2 accepting loop states [2024-02-09 23:25:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 188 transitions. [2024-02-09 23:25:47,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 188 transitions. Stem has 17 letters. Loop has 8 letters. [2024-02-09 23:25:47,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:47,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 188 transitions. Stem has 25 letters. Loop has 8 letters. [2024-02-09 23:25:47,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:47,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 188 transitions. Stem has 17 letters. Loop has 16 letters. [2024-02-09 23:25:47,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:47,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2772 states and 6942 transitions. [2024-02-09 23:25:47,569 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 464 [2024-02-09 23:25:47,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2772 states to 2674 states and 6708 transitions. [2024-02-09 23:25:47,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1667 [2024-02-09 23:25:47,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1721 [2024-02-09 23:25:47,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2674 states and 6708 transitions. [2024-02-09 23:25:47,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:47,581 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2674 states and 6708 transitions. [2024-02-09 23:25:47,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states and 6708 transitions. [2024-02-09 23:25:47,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 1884. [2024-02-09 23:25:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1884 states have (on average 2.5589171974522293) internal successors, (4821), 1883 states have internal predecessors, (4821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 4821 transitions. [2024-02-09 23:25:47,617 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1884 states and 4821 transitions. [2024-02-09 23:25:47,617 INFO L428 stractBuchiCegarLoop]: Abstraction has 1884 states and 4821 transitions. [2024-02-09 23:25:47,617 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-02-09 23:25:47,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1884 states and 4821 transitions. [2024-02-09 23:25:47,646 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 326 [2024-02-09 23:25:47,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:47,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:47,647 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:47,647 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:47,648 INFO L748 eck$LassoCheckResult]: Stem: 77799#[$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[] 77133#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 77135#[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] 77389#[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] 77391#[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] 78033#[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] 78011#[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] 77473#[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] 77099#[L40, 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] 77101#[L40, 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] 77625#[L40, 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] 80533#[L40, L67, ULTIMATE.startFINAL]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] 77553#[L40, ULTIMATE.startFINAL, L68-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[] 77351#[L43, ULTIMATE.startFINAL, L68-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[] 77803#[ULTIMATE.startFINAL, L44, L68-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] 77831#[ULTIMATE.startFINAL, L38, L68-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] 77833#[ULTIMATE.startFINAL, L68-1, L39]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] 80641#[ULTIMATE.startFINAL, L67, L68-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] 79457#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:25:47,648 INFO L750 eck$LassoCheckResult]: Loop: 79457#[L68-1, ULTIMATE.startFINAL, L68-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] 79447#[ULTIMATE.startFINAL, L39-1, L68-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] 79449#[L40, ULTIMATE.startFINAL, L68-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[] 80371#[L43, ULTIMATE.startFINAL, L68-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[] 79285#[ULTIMATE.startFINAL, L44, L68-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] 79287#[ULTIMATE.startFINAL, L38, L68-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] 78127#[ULTIMATE.startFINAL, L68-1, L39]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] 79501#[ULTIMATE.startFINAL, L67, L68-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] 79457#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:25:47,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:47,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1071830154, now seen corresponding path program 1 times [2024-02-09 23:25:47,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:47,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13900156] [2024-02-09 23:25:47,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:47,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:47,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:47,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:47,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:47,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:47,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1532400443, now seen corresponding path program 9 times [2024-02-09 23:25:47,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:47,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489455968] [2024-02-09 23:25:47,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:47,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:47,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:47,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:47,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:47,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1648046396, now seen corresponding path program 2 times [2024-02-09 23:25:47,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:47,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259215912] [2024-02-09 23:25:47,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:47,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:47,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:47,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:48,117 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:25:48,117 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:25:48,117 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:25:48,117 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:25:48,117 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:25:48,118 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:48,118 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:25:48,118 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:25:48,118 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration17_Lasso [2024-02-09 23:25:48,118 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:25:48,118 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:25:48,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:48,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:48,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-09 23:25:48,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:48,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:48,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:48,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:48,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:49,135 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-02-09 23:25:49,453 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:25:49,453 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:25:49,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:49,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:49,454 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:49,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-02-09 23:25:49,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:49,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:49,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:49,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:49,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:49,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:49,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:49,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:49,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:49,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-02-09 23:25:49,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:49,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:49,469 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:49,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-02-09 23:25:49,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:49,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:49,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:49,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:49,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:49,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:49,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:49,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:49,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:49,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:49,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:49,484 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:49,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-02-09 23:25:49,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:49,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:49,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:49,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:49,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:49,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:49,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:49,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:49,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:49,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:49,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:49,499 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:49,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-02-09 23:25:49,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:49,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:49,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:49,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:49,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:49,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:49,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:49,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:49,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-02-09 23:25:49,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:49,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:49,514 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:49,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-02-09 23:25:49,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:49,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:49,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:49,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:49,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:49,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:49,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:49,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:49,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:49,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:49,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:49,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:49,526 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:49,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-02-09 23:25:49,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:49,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:49,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:49,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:49,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:49,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:49,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:49,538 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:49,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2024-02-09 23:25:49,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:49,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:49,542 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:49,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-02-09 23:25:49,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:49,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:49,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:49,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:49,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:49,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:49,551 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:49,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:49,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2024-02-09 23:25:49,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:49,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:49,557 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:49,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-02-09 23:25:49,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:49,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:49,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:49,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:49,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:49,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:49,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:49,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:49,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2024-02-09 23:25:49,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:49,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:49,588 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:49,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-02-09 23:25:49,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:49,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:49,597 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:25:49,597 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:25:49,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:49,616 INFO L401 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2024-02-09 23:25:49,616 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:25:49,653 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:25:49,700 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-02-09 23:25:49,700 INFO L444 ModelExtractionUtils]: 30 out of 46 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-02-09 23:25:49,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:49,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:49,704 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:49,711 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:25:49,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-02-09 23:25:49,741 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:25:49,741 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:25:49,742 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerWithAssertThread1of1ForFork0_steal_num#1) = 3*N - 2*cnt + 2*workerWithAssertThread1of1ForFork0_steal_num#1 Supporting invariants [-2*cnt + 3*N >= 0] [2024-02-09 23:25:49,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:49,750 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:25:49,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:49,780 WARN L260 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2024-02-09 23:25:49,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:50,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:50,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:25:50,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:50,337 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 4 loop predicates [2024-02-09 23:25:50,338 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1884 states and 4821 transitions. cyclomatic complexity: 3018 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:50,553 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1884 states and 4821 transitions. cyclomatic complexity: 3018. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2451 states and 6143 transitions. Complement of second has 17 states. [2024-02-09 23:25:50,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 4 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:25:50,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2024-02-09 23:25:50,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 62 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:25:50,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:50,555 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:25:50,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:50,582 WARN L260 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2024-02-09 23:25:50,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:51,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:25:51,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:51,186 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 4 loop predicates [2024-02-09 23:25:51,186 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1884 states and 4821 transitions. cyclomatic complexity: 3018 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:51,396 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1884 states and 4821 transitions. cyclomatic complexity: 3018. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2451 states and 6143 transitions. Complement of second has 17 states. [2024-02-09 23:25:51,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 4 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:25:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2024-02-09 23:25:51,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 62 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:25:51,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:51,397 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:25:51,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:51,421 WARN L260 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2024-02-09 23:25:51,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:51,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:25:51,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:51,985 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 4 loop predicates [2024-02-09 23:25:51,985 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1884 states and 4821 transitions. cyclomatic complexity: 3018 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:52,698 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1884 states and 4821 transitions. cyclomatic complexity: 3018. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5450 states and 13445 transitions. Complement of second has 57 states. [2024-02-09 23:25:52,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 14 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:25:52,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:52,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 239 transitions. [2024-02-09 23:25:52,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 239 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:25:52,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:52,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 239 transitions. Stem has 26 letters. Loop has 8 letters. [2024-02-09 23:25:52,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:52,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 239 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:25:52,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:52,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5450 states and 13445 transitions. [2024-02-09 23:25:52,718 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 368 [2024-02-09 23:25:52,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5450 states to 4269 states and 10717 transitions. [2024-02-09 23:25:52,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2416 [2024-02-09 23:25:52,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2024-02-09 23:25:52,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4269 states and 10717 transitions. [2024-02-09 23:25:52,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:52,738 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4269 states and 10717 transitions. [2024-02-09 23:25:52,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4269 states and 10717 transitions. [2024-02-09 23:25:52,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4269 to 2340. [2024-02-09 23:25:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2340 states, 2340 states have (on average 2.5705128205128207) internal successors, (6015), 2339 states have internal predecessors, (6015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 6015 transitions. [2024-02-09 23:25:52,784 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2340 states and 6015 transitions. [2024-02-09 23:25:52,784 INFO L428 stractBuchiCegarLoop]: Abstraction has 2340 states and 6015 transitions. [2024-02-09 23:25:52,784 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-02-09 23:25:52,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2340 states and 6015 transitions. [2024-02-09 23:25:52,790 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 326 [2024-02-09 23:25:52,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:52,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:52,791 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:52,791 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:52,791 INFO L748 eck$LassoCheckResult]: Stem: 92377#[$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[] 91705#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 91707#[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] 92583#[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] 92491#[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] 92059#[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] 92061#[L68-1, 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] 92781#[L68-1, 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] 93389#[L68-1, ULTIMATE.startFINAL, L54]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] 95631#[ULTIMATE.startFINAL, L39-1, L54]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] 95625#[L40, ULTIMATE.startFINAL, L54]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[] 95445#[L43, ULTIMATE.startFINAL, L54]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[] 95591#[ULTIMATE.startFINAL, L44, L54]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] 95593#[ULTIMATE.startFINAL, L38, L54]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] 91889#[ULTIMATE.startFINAL, L39, L54]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] 91891#[ULTIMATE.startFINAL, L67, 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] 92641#[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] 94467#[ULTIMATE.startFINAL, L67, L68-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] 93071#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:25:52,792 INFO L750 eck$LassoCheckResult]: Loop: 93071#[L68-1, ULTIMATE.startFINAL, L68-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] 93075#[ULTIMATE.startFINAL, L39-1, L68-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] 92999#[L40, ULTIMATE.startFINAL, L68-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[] 93001#[L43, ULTIMATE.startFINAL, L68-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[] 93187#[ULTIMATE.startFINAL, L44, L68-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] 93165#[ULTIMATE.startFINAL, L38, L68-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] 92937#[ULTIMATE.startFINAL, L68-1, L39]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] 93507#[ULTIMATE.startFINAL, L67, L68-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] 93071#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:25:52,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:52,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1508010438, now seen corresponding path program 3 times [2024-02-09 23:25:52,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:52,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754070086] [2024-02-09 23:25:52,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:52,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:52,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:52,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:52,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:52,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1532400443, now seen corresponding path program 10 times [2024-02-09 23:25:52,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:52,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941540292] [2024-02-09 23:25:52,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:52,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:52,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:52,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:52,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:52,807 INFO L85 PathProgramCache]: Analyzing trace with hash -580294656, now seen corresponding path program 4 times [2024-02-09 23:25:52,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:52,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385332886] [2024-02-09 23:25:52,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:52,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:52,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:52,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:53,229 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:25:53,230 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:25:53,230 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:25:53,230 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:25:53,230 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:25:53,230 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:53,230 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:25:53,230 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:25:53,230 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration18_Lasso [2024-02-09 23:25:53,230 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:25:53,230 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:25:53,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:53,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:53,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:53,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:53,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:53,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:53,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:53,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:53,936 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2024-02-09 23:25:54,245 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:25:54,245 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:25:54,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:54,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:54,246 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:54,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2024-02-09 23:25:54,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:54,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:54,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:54,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:54,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:54,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:54,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:54,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:54,256 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:54,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:54,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:54,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:54,259 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:54,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-02-09 23:25:54,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:54,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:54,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:54,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:54,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:54,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:54,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:54,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:54,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2024-02-09 23:25:54,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:54,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:54,274 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:54,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-02-09 23:25:54,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:54,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:54,282 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:25:54,282 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:25:54,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:54,302 INFO L401 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2024-02-09 23:25:54,302 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:25:54,339 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:25:54,379 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2024-02-09 23:25:54,379 INFO L444 ModelExtractionUtils]: 28 out of 46 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-02-09 23:25:54,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:54,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:54,384 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:54,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-02-09 23:25:54,387 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:25:54,394 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:25:54,394 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:25:54,394 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 [3*N - 2*cnt >= 0] [2024-02-09 23:25:54,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:54,401 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:25:54,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:54,426 WARN L260 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2024-02-09 23:25:54,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:54,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:25:54,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:54,849 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 4 loop predicates [2024-02-09 23:25:54,850 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2340 states and 6015 transitions. cyclomatic complexity: 3756 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:55,057 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2340 states and 6015 transitions. cyclomatic complexity: 3756. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3104 states and 7771 transitions. Complement of second has 17 states. [2024-02-09 23:25:55,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 4 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:25:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2024-02-09 23:25:55,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 62 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:25:55,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:55,058 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:25:55,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:55,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:25:55,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:55,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:55,382 WARN L260 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-09 23:25:55,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:55,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:55,459 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 5 loop predicates [2024-02-09 23:25:55,459 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2340 states and 6015 transitions. cyclomatic complexity: 3756 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:55,687 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2340 states and 6015 transitions. cyclomatic complexity: 3756. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3104 states and 7771 transitions. Complement of second has 19 states. [2024-02-09 23:25:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 4 stem states 6 non-accepting loop states 2 accepting loop states [2024-02-09 23:25:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 66 transitions. [2024-02-09 23:25:55,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 66 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:25:55,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:55,688 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:25:55,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:55,714 WARN L260 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2024-02-09 23:25:55,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:56,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:25:56,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:56,178 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 4 loop predicates [2024-02-09 23:25:56,178 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2340 states and 6015 transitions. cyclomatic complexity: 3756 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:56,880 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2340 states and 6015 transitions. cyclomatic complexity: 3756. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5812 states and 14336 transitions. Complement of second has 55 states. [2024-02-09 23:25:56,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 14 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:25:56,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 192 transitions. [2024-02-09 23:25:56,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 192 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:25:56,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:56,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 192 transitions. Stem has 26 letters. Loop has 8 letters. [2024-02-09 23:25:56,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:56,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 192 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:25:56,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:56,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5812 states and 14336 transitions. [2024-02-09 23:25:56,931 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 368 [2024-02-09 23:25:56,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5812 states to 4219 states and 10608 transitions. [2024-02-09 23:25:56,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2434 [2024-02-09 23:25:56,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2728 [2024-02-09 23:25:56,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4219 states and 10608 transitions. [2024-02-09 23:25:56,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:56,949 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4219 states and 10608 transitions. [2024-02-09 23:25:56,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4219 states and 10608 transitions. [2024-02-09 23:25:56,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4219 to 2419. [2024-02-09 23:25:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2419 states, 2419 states have (on average 2.5601488218272013) internal successors, (6193), 2418 states have internal predecessors, (6193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 6193 transitions. [2024-02-09 23:25:56,994 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2419 states and 6193 transitions. [2024-02-09 23:25:56,994 INFO L428 stractBuchiCegarLoop]: Abstraction has 2419 states and 6193 transitions. [2024-02-09 23:25:56,994 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-02-09 23:25:56,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2419 states and 6193 transitions. [2024-02-09 23:25:57,001 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 326 [2024-02-09 23:25:57,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:57,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:57,002 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:57,002 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:57,004 INFO L748 eck$LassoCheckResult]: Stem: 109529#[$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[] 108843#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 108845#[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] 109693#[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] 109809#[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] 109801#[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] 109727#[L68-1, 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] 109731#[L68-1, 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] 111633#[L68-1, ULTIMATE.startFINAL, L54]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] 112011#[ULTIMATE.startFINAL, L39-1, L54]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] 112005#[L40, 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] 112977#[L40, L67, ULTIMATE.startFINAL]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] 112967#[L40, ULTIMATE.startFINAL, L68-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[] 112951#[L43, ULTIMATE.startFINAL, L68-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[] 112941#[ULTIMATE.startFINAL, L44, L68-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] 112909#[ULTIMATE.startFINAL, L38, L68-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] 112903#[ULTIMATE.startFINAL, L68-1, L39]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] 110465#[ULTIMATE.startFINAL, L67, L68-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] 110419#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:25:57,004 INFO L750 eck$LassoCheckResult]: Loop: 110419#[L68-1, ULTIMATE.startFINAL, L68-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] 110423#[ULTIMATE.startFINAL, L39-1, L68-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] 110181#[L40, ULTIMATE.startFINAL, L68-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[] 110185#[L43, ULTIMATE.startFINAL, L68-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[] 110269#[ULTIMATE.startFINAL, L44, L68-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] 110239#[ULTIMATE.startFINAL, L38, L68-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] 109863#[ULTIMATE.startFINAL, L68-1, L39]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] 112397#[ULTIMATE.startFINAL, L67, L68-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] 110419#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:25:57,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:57,005 INFO L85 PathProgramCache]: Analyzing trace with hash 33627338, now seen corresponding path program 5 times [2024-02-09 23:25:57,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:57,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901719385] [2024-02-09 23:25:57,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:57,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:57,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:57,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:57,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:57,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1532400443, now seen corresponding path program 11 times [2024-02-09 23:25:57,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:57,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506923208] [2024-02-09 23:25:57,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:57,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:57,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:57,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:57,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:57,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1305028860, now seen corresponding path program 6 times [2024-02-09 23:25:57,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:57,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369915853] [2024-02-09 23:25:57,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:57,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:57,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:57,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:57,473 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:25:57,473 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:25:57,474 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:25:57,474 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:25:57,474 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:25:57,474 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:57,474 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:25:57,474 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:25:57,474 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration19_Lasso [2024-02-09 23:25:57,474 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:25:57,474 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:25:57,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:57,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:57,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:57,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:58,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:58,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:58,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:58,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:58,400 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-02-09 23:25:58,717 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:25:58,717 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:25:58,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:58,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:58,718 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:58,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-02-09 23:25:58,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:58,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:58,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:58,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:58,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:58,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:58,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:58,730 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:58,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:58,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:58,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:58,733 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:58,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-02-09 23:25:58,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-09 23:25:58,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:58,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:58,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:58,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:58,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:58,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:58,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:58,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:58,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2024-02-09 23:25:58,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:58,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:58,746 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:58,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-02-09 23:25:58,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:58,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:58,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:58,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:58,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:58,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:58,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:58,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:58,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-02-09 23:25:58,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:58,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:58,761 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:58,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:58,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-02-09 23:25:58,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:58,777 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:25:58,777 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:25:58,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:58,797 INFO L401 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2024-02-09 23:25:58,797 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:25:58,831 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:25:58,866 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-02-09 23:25:58,866 INFO L444 ModelExtractionUtils]: 34 out of 46 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-02-09 23:25:58,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:58,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:58,867 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:58,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-02-09 23:25:58,869 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:25:58,877 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:25:58,877 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:25:58,877 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 [3*N - 2*cnt >= 0] [2024-02-09 23:25:58,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2024-02-09 23:25:58,884 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:25:58,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:58,914 WARN L260 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2024-02-09 23:25:58,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:59,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:25:59,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:59,516 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 4 loop predicates [2024-02-09 23:25:59,516 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2419 states and 6193 transitions. cyclomatic complexity: 3855 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:59,729 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2419 states and 6193 transitions. cyclomatic complexity: 3855. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3263 states and 8106 transitions. Complement of second has 17 states. [2024-02-09 23:25:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 4 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:25:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:59,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2024-02-09 23:25:59,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 62 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:25:59,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:59,730 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:25:59,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:59,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:25:59,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:59,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2024-02-09 23:26:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:00,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:26:00,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:00,196 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 4 loop predicates [2024-02-09 23:26:00,196 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2419 states and 6193 transitions. cyclomatic complexity: 3855 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:00,412 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2419 states and 6193 transitions. cyclomatic complexity: 3855. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3263 states and 8106 transitions. Complement of second has 17 states. [2024-02-09 23:26:00,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 4 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2024-02-09 23:26:00,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 62 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:26:00,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:00,413 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:00,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:00,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:26:00,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:00,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:26:00,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:00,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:00,828 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 4 loop predicates [2024-02-09 23:26:00,828 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2419 states and 6193 transitions. cyclomatic complexity: 3855 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:01,317 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2419 states and 6193 transitions. cyclomatic complexity: 3855. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5984 states and 15002 transitions. Complement of second has 46 states. [2024-02-09 23:26:01,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 12 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 206 transitions. [2024-02-09 23:26:01,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 206 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:26:01,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:01,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 206 transitions. Stem has 26 letters. Loop has 8 letters. [2024-02-09 23:26:01,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:01,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 206 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:01,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:01,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5984 states and 15002 transitions. [2024-02-09 23:26:01,350 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 368 [2024-02-09 23:26:01,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5984 states to 4598 states and 11700 transitions. [2024-02-09 23:26:01,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2678 [2024-02-09 23:26:01,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2903 [2024-02-09 23:26:01,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4598 states and 11700 transitions. [2024-02-09 23:26:01,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:26:01,373 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4598 states and 11700 transitions. [2024-02-09 23:26:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4598 states and 11700 transitions. [2024-02-09 23:26:01,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4598 to 2745. [2024-02-09 23:26:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2745 states, 2745 states have (on average 2.585063752276867) internal successors, (7096), 2744 states have internal predecessors, (7096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2745 states to 2745 states and 7096 transitions. [2024-02-09 23:26:01,420 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2745 states and 7096 transitions. [2024-02-09 23:26:01,420 INFO L428 stractBuchiCegarLoop]: Abstraction has 2745 states and 7096 transitions. [2024-02-09 23:26:01,420 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-02-09 23:26:01,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2745 states and 7096 transitions. [2024-02-09 23:26:01,428 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 326 [2024-02-09 23:26:01,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:26:01,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:26:01,430 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:01,430 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:01,431 INFO L748 eck$LassoCheckResult]: Stem: 127316#[$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[] 126626#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 126628#[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] 127514#[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] 127640#[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] 127632#[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] 127554#[L68-1, 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] 127556#[L68-1, 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] 129034#[L68-1, 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] 130984#[L68-1, L67, ULTIMATE.startFINAL]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] 130974#[L68-1, ULTIMATE.startFINAL, L68-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] 130972#[ULTIMATE.startFINAL, L39-1, L68-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] 130932#[L40, ULTIMATE.startFINAL, L68-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[] 130920#[L43, ULTIMATE.startFINAL, L68-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[] 130912#[ULTIMATE.startFINAL, L44, L68-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] 130904#[ULTIMATE.startFINAL, L38, L68-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] 130888#[ULTIMATE.startFINAL, L68-1, L39]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] 129040#[ULTIMATE.startFINAL, L67, L68-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] 128220#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:01,431 INFO L750 eck$LassoCheckResult]: Loop: 128220#[L68-1, ULTIMATE.startFINAL, L68-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] 128224#[ULTIMATE.startFINAL, L39-1, L68-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] 128002#[L40, ULTIMATE.startFINAL, L68-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[] 128004#[L43, ULTIMATE.startFINAL, L68-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[] 128110#[ULTIMATE.startFINAL, L44, L68-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] 128080#[ULTIMATE.startFINAL, L38, L68-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] 127698#[ULTIMATE.startFINAL, L68-1, L39]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] 130594#[ULTIMATE.startFINAL, L67, L68-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] 128220#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:01,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:01,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1420195702, now seen corresponding path program 7 times [2024-02-09 23:26:01,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:01,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919338808] [2024-02-09 23:26:01,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:01,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:01,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:01,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:01,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:01,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1532400443, now seen corresponding path program 12 times [2024-02-09 23:26:01,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:01,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271237761] [2024-02-09 23:26:01,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:01,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:01,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:01,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:01,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:01,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1363641028, now seen corresponding path program 8 times [2024-02-09 23:26:01,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:01,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908630021] [2024-02-09 23:26:01,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:01,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:01,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:01,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:01,931 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:26:01,931 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:26:01,931 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:26:01,931 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:26:01,931 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:26:01,931 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:01,931 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:26:01,931 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:26:01,931 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration20_Lasso [2024-02-09 23:26:01,931 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:26:01,931 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:26:01,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:01,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:01,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:01,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:02,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:02,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:02,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:02,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:02,670 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2024-02-09 23:26:02,983 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:26:02,983 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:26:02,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:02,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:02,984 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:02,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-02-09 23:26:02,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:02,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:02,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:02,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:02,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:02,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:02,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:02,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:02,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2024-02-09 23:26:02,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:02,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:02,999 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:03,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-02-09 23:26:03,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:03,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:03,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:26:03,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:03,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:03,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:03,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:26:03,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:26:03,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:03,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:03,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:03,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:03,012 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:03,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2024-02-09 23:26:03,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:03,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:03,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:26:03,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:03,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:03,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:03,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:26:03,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:26:03,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:03,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:03,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:03,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:03,024 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:03,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2024-02-09 23:26:03,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:03,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:03,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:03,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:03,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:03,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:03,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:03,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:03,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2024-02-09 23:26:03,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:03,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:03,039 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:03,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2024-02-09 23:26:03,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:03,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:03,047 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:26:03,047 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:26:03,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:03,066 INFO L401 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2024-02-09 23:26:03,066 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:26:03,099 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:26:03,152 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2024-02-09 23:26:03,152 INFO L444 ModelExtractionUtils]: 30 out of 46 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-02-09 23:26:03,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:03,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:03,153 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:03,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-02-09 23:26:03,155 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:26:03,162 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:26:03,162 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:26:03,163 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 [3*N - 2*cnt >= 0] [2024-02-09 23:26:03,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:03,169 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:26:03,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:03,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:26:03,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:03,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:26:03,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:03,585 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 4 loop predicates [2024-02-09 23:26:03,585 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2745 states and 7096 transitions. cyclomatic complexity: 4460 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:03,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:03,834 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2745 states and 7096 transitions. cyclomatic complexity: 4460. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3660 states and 9147 transitions. Complement of second has 17 states. [2024-02-09 23:26:03,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 4 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:03,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2024-02-09 23:26:03,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 62 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:26:03,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:03,835 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:03,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:03,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 15 conjunts are in the unsatisfiable core [2024-02-09 23:26:03,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:04,272 WARN L260 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-09 23:26:04,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:04,359 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 5 loop predicates [2024-02-09 23:26:04,359 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2745 states and 7096 transitions. cyclomatic complexity: 4460 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:04,608 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2745 states and 7096 transitions. cyclomatic complexity: 4460. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3660 states and 9147 transitions. Complement of second has 19 states. [2024-02-09 23:26:04,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 4 stem states 6 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:04,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:04,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 66 transitions. [2024-02-09 23:26:04,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 66 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:26:04,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:04,609 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:04,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:04,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 15 conjunts are in the unsatisfiable core [2024-02-09 23:26:04,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:05,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:26:05,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:05,061 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 4 loop predicates [2024-02-09 23:26:05,061 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2745 states and 7096 transitions. cyclomatic complexity: 4460 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:05,792 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2745 states and 7096 transitions. cyclomatic complexity: 4460. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7337 states and 18399 transitions. Complement of second has 61 states. [2024-02-09 23:26:05,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 15 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 265 transitions. [2024-02-09 23:26:05,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 265 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:26:05,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:05,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 265 transitions. Stem has 26 letters. Loop has 8 letters. [2024-02-09 23:26:05,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:05,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 265 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:05,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:05,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7337 states and 18399 transitions. [2024-02-09 23:26:05,856 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 368 [2024-02-09 23:26:05,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7337 states to 5867 states and 14842 transitions. [2024-02-09 23:26:05,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3098 [2024-02-09 23:26:05,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3351 [2024-02-09 23:26:05,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5867 states and 14842 transitions. [2024-02-09 23:26:05,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:26:05,879 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5867 states and 14842 transitions. [2024-02-09 23:26:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5867 states and 14842 transitions. [2024-02-09 23:26:05,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5867 to 2777. [2024-02-09 23:26:05,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2777 states, 2777 states have (on average 2.586244148361541) internal successors, (7182), 2776 states have internal predecessors, (7182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 7182 transitions. [2024-02-09 23:26:05,932 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2777 states and 7182 transitions. [2024-02-09 23:26:05,932 INFO L428 stractBuchiCegarLoop]: Abstraction has 2777 states and 7182 transitions. [2024-02-09 23:26:05,932 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-02-09 23:26:05,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2777 states and 7182 transitions. [2024-02-09 23:26:05,940 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 326 [2024-02-09 23:26:05,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:26:05,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:26:05,940 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:05,940 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:05,941 INFO L748 eck$LassoCheckResult]: Stem: 147895#[$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[] 147221#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 147223#[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] 148089#[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] 148209#[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] 148379#[L67, 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] 149677#[ULTIMATE.startFINAL, L53, L67]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] 149759#[ULTIMATE.startFINAL, L67, L54]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] 149813#[L68-1, ULTIMATE.startFINAL, L54]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] 149745#[ULTIMATE.startFINAL, L39-1, L54]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] 149739#[L40, ULTIMATE.startFINAL, L54]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[] 149717#[L43, ULTIMATE.startFINAL, L54]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[] 149703#[ULTIMATE.startFINAL, L44, L54]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] 149705#[ULTIMATE.startFINAL, L38, L54]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] 149801#[ULTIMATE.startFINAL, L39, L54]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] 152477#[ULTIMATE.startFINAL, L67, 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] 152471#[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] 152469#[ULTIMATE.startFINAL, L67, L68-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] 148775#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:05,941 INFO L750 eck$LassoCheckResult]: Loop: 148775#[L68-1, ULTIMATE.startFINAL, L68-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] 148761#[ULTIMATE.startFINAL, L39-1, L68-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] 148721#[L40, ULTIMATE.startFINAL, L68-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[] 148723#[L43, ULTIMATE.startFINAL, L68-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[] 148733#[ULTIMATE.startFINAL, L44, L68-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] 149307#[ULTIMATE.startFINAL, L38, L68-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] 148259#[ULTIMATE.startFINAL, L68-1, L39]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] 150095#[ULTIMATE.startFINAL, L67, L68-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] 148775#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:05,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:05,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1813308954, now seen corresponding path program 9 times [2024-02-09 23:26:05,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:05,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662384445] [2024-02-09 23:26:05,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:05,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:05,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:05,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:05,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:05,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1532400443, now seen corresponding path program 13 times [2024-02-09 23:26:05,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:05,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951262424] [2024-02-09 23:26:05,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:05,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:05,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:05,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:05,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:05,967 INFO L85 PathProgramCache]: Analyzing trace with hash 609220640, now seen corresponding path program 10 times [2024-02-09 23:26:05,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:05,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450372385] [2024-02-09 23:26:05,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:05,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:05,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:05,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:06,433 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:26:06,433 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:26:06,433 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:26:06,433 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:26:06,433 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:26:06,433 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:06,433 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:26:06,434 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:26:06,434 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration21_Lasso [2024-02-09 23:26:06,434 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:26:06,434 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:26:06,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:06,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:06,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:07,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:07,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-09 23:26:07,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-09 23:26:07,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:07,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:07,193 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-02-09 23:26:07,496 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:26:07,496 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:26:07,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:07,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:07,497 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:07,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2024-02-09 23:26:07,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:07,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:07,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:26:07,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:07,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:07,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:07,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:26:07,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:26:07,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:07,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:07,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:07,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:07,511 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:07,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2024-02-09 23:26:07,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:07,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:07,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:07,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:07,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:07,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:07,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:07,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:07,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2024-02-09 23:26:07,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:07,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:07,527 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:07,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-02-09 23:26:07,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:07,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:07,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:07,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:07,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:07,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:07,538 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:07,540 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:07,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:07,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:07,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:07,544 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:07,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-02-09 23:26:07,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:07,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:07,553 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:26:07,553 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:26:07,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:07,575 INFO L401 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2024-02-09 23:26:07,575 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:26:07,609 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:26:07,645 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-02-09 23:26:07,645 INFO L444 ModelExtractionUtils]: 32 out of 46 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-02-09 23:26:07,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:07,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:07,646 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:07,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-02-09 23:26:07,648 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:26:07,681 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:26:07,681 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:26:07,681 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerWithAssertThread1of1ForFork0_steal_num#1) = 3*N - 2*cnt + 2*workerWithAssertThread1of1ForFork0_steal_num#1 Supporting invariants [-2*cnt + 3*N >= 0] [2024-02-09 23:26:07,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:07,688 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:26:07,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:07,712 WARN L260 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2024-02-09 23:26:07,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:08,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:26:08,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:08,107 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 4 loop predicates [2024-02-09 23:26:08,107 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2777 states and 7182 transitions. cyclomatic complexity: 4514 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:08,309 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2777 states and 7182 transitions. cyclomatic complexity: 4514. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3716 states and 9285 transitions. Complement of second has 18 states. [2024-02-09 23:26:08,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 5 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:08,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2024-02-09 23:26:08,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 67 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:26:08,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:08,310 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:08,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:08,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:26:08,334 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:08,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:26:08,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:08,692 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 4 loop predicates [2024-02-09 23:26:08,692 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2777 states and 7182 transitions. cyclomatic complexity: 4514 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:08,923 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2777 states and 7182 transitions. cyclomatic complexity: 4514. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3716 states and 9285 transitions. Complement of second has 18 states. [2024-02-09 23:26:08,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 5 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2024-02-09 23:26:08,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 67 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:26:08,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:08,924 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:08,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:08,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:26:08,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:09,293 WARN L260 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-09 23:26:09,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:09,375 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 5 loop predicates [2024-02-09 23:26:09,375 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2777 states and 7182 transitions. cyclomatic complexity: 4514 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:09,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2024-02-09 23:26:09,937 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2777 states and 7182 transitions. cyclomatic complexity: 4514. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 4826 states and 12079 transitions. Complement of second has 38 states. [2024-02-09 23:26:09,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 13 stem states 6 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 202 transitions. [2024-02-09 23:26:09,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 202 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:26:09,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:09,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 202 transitions. Stem has 26 letters. Loop has 8 letters. [2024-02-09 23:26:09,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:09,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 202 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:09,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:09,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4826 states and 12079 transitions. [2024-02-09 23:26:09,953 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 368 [2024-02-09 23:26:09,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4826 states to 3908 states and 9996 transitions. [2024-02-09 23:26:09,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2266 [2024-02-09 23:26:09,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2460 [2024-02-09 23:26:09,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3908 states and 9996 transitions. [2024-02-09 23:26:09,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:26:09,964 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3908 states and 9996 transitions. [2024-02-09 23:26:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states and 9996 transitions. [2024-02-09 23:26:09,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 2842. [2024-02-09 23:26:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2842 states, 2842 states have (on average 2.586910626319493) internal successors, (7352), 2841 states have internal predecessors, (7352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2842 states and 7352 transitions. [2024-02-09 23:26:10,009 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2842 states and 7352 transitions. [2024-02-09 23:26:10,009 INFO L428 stractBuchiCegarLoop]: Abstraction has 2842 states and 7352 transitions. [2024-02-09 23:26:10,009 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-02-09 23:26:10,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2842 states and 7352 transitions. [2024-02-09 23:26:10,017 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 326 [2024-02-09 23:26:10,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:26:10,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:26:10,017 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:10,017 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:10,018 INFO L748 eck$LassoCheckResult]: Stem: 166205#[$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[] 165461#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 165463#[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] 166421#[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] 166551#[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] 166543#[L67, 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] 166545#[ULTIMATE.startFINAL, L53, L67]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] 167655#[ULTIMATE.startFINAL, L67, L54]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] 167657#[L68-1, 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] 167521#[L68-1, L67, ULTIMATE.startFINAL]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] 167513#[L68-1, ULTIMATE.startFINAL, L68-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] 167477#[ULTIMATE.startFINAL, L39-1, L68-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] 169267#[L40, ULTIMATE.startFINAL, L68-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[] 169259#[L43, ULTIMATE.startFINAL, L68-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[] 169255#[ULTIMATE.startFINAL, L44, L68-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] 169245#[ULTIMATE.startFINAL, L38, L68-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] 169247#[ULTIMATE.startFINAL, L68-1, L39]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] 169237#[ULTIMATE.startFINAL, L67, L68-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] 167059#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:10,018 INFO L750 eck$LassoCheckResult]: Loop: 167059#[L68-1, ULTIMATE.startFINAL, L68-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] 167047#[ULTIMATE.startFINAL, L39-1, L68-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] 167031#[L40, ULTIMATE.startFINAL, L68-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[] 167013#[L43, ULTIMATE.startFINAL, L68-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[] 166991#[ULTIMATE.startFINAL, L44, L68-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] 166961#[ULTIMATE.startFINAL, L38, L68-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] 166623#[ULTIMATE.startFINAL, L68-1, L39]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] 169203#[ULTIMATE.startFINAL, L67, L68-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] 167059#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:10,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:10,018 INFO L85 PathProgramCache]: Analyzing trace with hash -446547798, now seen corresponding path program 11 times [2024-02-09 23:26:10,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:10,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249337388] [2024-02-09 23:26:10,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:10,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:10,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:10,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:10,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:10,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1532400443, now seen corresponding path program 14 times [2024-02-09 23:26:10,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:10,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677408778] [2024-02-09 23:26:10,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:10,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:10,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:10,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:10,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:10,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1741810972, now seen corresponding path program 12 times [2024-02-09 23:26:10,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:10,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961983355] [2024-02-09 23:26:10,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:10,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:10,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:10,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:10,510 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:26:10,511 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:26:10,511 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:26:10,511 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:26:10,511 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:26:10,511 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:10,511 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:26:10,511 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:26:10,511 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration22_Lasso [2024-02-09 23:26:10,511 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:26:10,511 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:26:10,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:10,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:11,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:11,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:11,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:11,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:11,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:11,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:11,219 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-02-09 23:26:11,697 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:26:11,697 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:26:11,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:11,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:11,698 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:11,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-02-09 23:26:11,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:11,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:11,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:11,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:11,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:11,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:11,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:11,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:11,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:11,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:11,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:11,713 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:11,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-02-09 23:26:11,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:11,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:11,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:11,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:11,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:11,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:11,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:11,724 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:11,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:11,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:11,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:11,728 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:11,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2024-02-09 23:26:11,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:11,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:11,735 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:26:11,735 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:26:11,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:11,753 INFO L401 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2024-02-09 23:26:11,753 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:26:11,788 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:26:11,817 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-02-09 23:26:11,817 INFO L444 ModelExtractionUtils]: 30 out of 46 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-02-09 23:26:11,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:11,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:11,818 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:11,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2024-02-09 23:26:11,820 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:26:11,827 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:26:11,827 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:26:11,827 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerWithAssertThread1of1ForFork0_steal_num#1) = 1*N - 1*cnt + 1*workerWithAssertThread1of1ForFork0_steal_num#1 Supporting invariants [-1*cnt + 1*N >= 0] [2024-02-09 23:26:11,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:11,834 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:26:11,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:11,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:26:11,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:11,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-09 23:26:11,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:12,020 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2024-02-09 23:26:12,020 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2842 states and 7352 transitions. cyclomatic complexity: 4619 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:12,148 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2842 states and 7352 transitions. cyclomatic complexity: 4619. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3918 states and 10115 transitions. Complement of second has 15 states. [2024-02-09 23:26:12,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 4 stem states 4 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:12,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2024-02-09 23:26:12,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 95 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:26:12,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:12,149 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:12,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:12,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:26:12,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:12,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-09 23:26:12,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:12,339 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2024-02-09 23:26:12,339 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2842 states and 7352 transitions. cyclomatic complexity: 4619 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:12,477 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2842 states and 7352 transitions. cyclomatic complexity: 4619. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3918 states and 10115 transitions. Complement of second has 15 states. [2024-02-09 23:26:12,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 4 stem states 4 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:12,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:12,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2024-02-09 23:26:12,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 95 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:26:12,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:12,478 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:12,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:12,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:26:12,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:12,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-09 23:26:12,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:12,655 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2024-02-09 23:26:12,655 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2842 states and 7352 transitions. cyclomatic complexity: 4619 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:12,806 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2842 states and 7352 transitions. cyclomatic complexity: 4619. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5077 states and 13163 transitions. Complement of second has 14 states. [2024-02-09 23:26:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 4 stem states 4 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:12,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-02-09 23:26:12,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 119 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:26:12,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:12,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 119 transitions. Stem has 26 letters. Loop has 8 letters. [2024-02-09 23:26:12,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:12,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 119 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:12,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:12,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5077 states and 13163 transitions. [2024-02-09 23:26:12,824 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 552 [2024-02-09 23:26:12,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5077 states to 4215 states and 10829 transitions. [2024-02-09 23:26:12,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2255 [2024-02-09 23:26:12,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2416 [2024-02-09 23:26:12,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4215 states and 10829 transitions. [2024-02-09 23:26:12,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:26:12,835 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4215 states and 10829 transitions. [2024-02-09 23:26:12,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4215 states and 10829 transitions. [2024-02-09 23:26:12,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4215 to 1700. [2024-02-09 23:26:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1700 states have (on average 2.58) internal successors, (4386), 1699 states have internal predecessors, (4386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 4386 transitions. [2024-02-09 23:26:12,867 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1700 states and 4386 transitions. [2024-02-09 23:26:12,867 INFO L428 stractBuchiCegarLoop]: Abstraction has 1700 states and 4386 transitions. [2024-02-09 23:26:12,867 INFO L335 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-02-09 23:26:12,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1700 states and 4386 transitions. [2024-02-09 23:26:12,872 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 524 [2024-02-09 23:26:12,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:26:12,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:26:12,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:12,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:12,873 INFO L748 eck$LassoCheckResult]: Stem: 184584#[$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[] 184536#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 184538#[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] 185128#[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] 185322#[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] 185318#[L67, 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] 185320#[ULTIMATE.startFINAL, L53, L67]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] 186180#[ULTIMATE.startFINAL, L67, 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] 186160#[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] 186162#[ULTIMATE.startFINAL, L67, L68-1]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] 185716#[ULTIMATE.startFINAL, L67, L54-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] 186418#[L68-1, ULTIMATE.startFINAL, L54-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] 185698#[ULTIMATE.startFINAL, L39-1, L54-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] 185688#[L40, ULTIMATE.startFINAL, L54-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[] 185548#[L43, ULTIMATE.startFINAL, L54-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[] 185496#[ULTIMATE.startFINAL, L54-1, L44]don't care [2024-02-09 23:26:12,873 INFO L750 eck$LassoCheckResult]: Loop: 185496#[ULTIMATE.startFINAL, L54-1, L44]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] 185538#[ULTIMATE.startFINAL, L54-1, 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] 185298#[ULTIMATE.startFINAL, L54-1, L39]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] 185302#[ULTIMATE.startFINAL, L67, L54-1]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] 187546#[L55, ULTIMATE.startFINAL, L67]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[] 184620#[ULTIMATE.startFINAL, L67, 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[] 184622#[ULTIMATE.startFINAL, L67, L59]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] 184952#[ULTIMATE.startFINAL, L53, L67]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] 184786#[ULTIMATE.startFINAL, L67, 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] 185280#[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] 187604#[ULTIMATE.startFINAL, L67, L68-1]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] 187602#[ULTIMATE.startFINAL, L67, L54-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] 187410#[L68-1, ULTIMATE.startFINAL, L54-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] 185596#[ULTIMATE.startFINAL, L39-1, L54-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] 185582#[L40, ULTIMATE.startFINAL, L54-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[] 185492#[L43, ULTIMATE.startFINAL, L54-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[] 185496#[ULTIMATE.startFINAL, L54-1, L44]don't care [2024-02-09 23:26:12,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:12,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1836354258, now seen corresponding path program 1 times [2024-02-09 23:26:12,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:12,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106554321] [2024-02-09 23:26:12,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:12,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:12,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:12,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:12,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:12,880 INFO L85 PathProgramCache]: Analyzing trace with hash 904304405, now seen corresponding path program 1 times [2024-02-09 23:26:12,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:12,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601767573] [2024-02-09 23:26:12,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:12,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:12,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:12,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:12,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash 583275074, now seen corresponding path program 1 times [2024-02-09 23:26:12,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:12,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513414154] [2024-02-09 23:26:12,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:12,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:12,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:12,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:13,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:13,294 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:26:13,294 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:26:13,294 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:26:13,294 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:26:13,294 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:26:13,295 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:13,295 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:26:13,295 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:26:13,295 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration23_Lasso [2024-02-09 23:26:13,295 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:26:13,295 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:26:13,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:13,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:13,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:13,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:13,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:13,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:13,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:13,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:13,632 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:26:13,632 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:26:13,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:13,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:13,633 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:13,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2024-02-09 23:26:13,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:13,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:13,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:13,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:13,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:13,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:13,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:13,681 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:26:13,696 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-02-09 23:26:13,696 INFO L444 ModelExtractionUtils]: 17 out of 28 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-02-09 23:26:13,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:13,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:13,697 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:13,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2024-02-09 23:26:13,699 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:26:13,708 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:26:13,708 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:26:13,708 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(cnt, N) = -1*cnt + 1*N Supporting invariants [] [2024-02-09 23:26:13,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:13,713 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:26:13,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:13,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:26:13,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:13,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-09 23:26:13,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:13,946 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2024-02-09 23:26:13,946 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1700 states and 4386 transitions. cyclomatic complexity: 2747 Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:14,126 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1700 states and 4386 transitions. cyclomatic complexity: 2747. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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 5727 states and 14468 transitions. Complement of second has 15 states. [2024-02-09 23:26:14,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2024-02-09 23:26:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-02-09 23:26:14,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 103 transitions. Stem has 15 letters. Loop has 16 letters. [2024-02-09 23:26:14,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:14,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 103 transitions. Stem has 31 letters. Loop has 16 letters. [2024-02-09 23:26:14,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:14,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 103 transitions. Stem has 15 letters. Loop has 32 letters. [2024-02-09 23:26:14,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:14,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5727 states and 14468 transitions. [2024-02-09 23:26:14,154 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 652 [2024-02-09 23:26:14,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5727 states to 5041 states and 12775 transitions. [2024-02-09 23:26:14,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2278 [2024-02-09 23:26:14,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2485 [2024-02-09 23:26:14,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5041 states and 12775 transitions. [2024-02-09 23:26:14,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:26:14,173 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5041 states and 12775 transitions. [2024-02-09 23:26:14,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5041 states and 12775 transitions. [2024-02-09 23:26:14,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5041 to 3414. [2024-02-09 23:26:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3414 states, 3414 states have (on average 2.637375512595196) internal successors, (9004), 3413 states have internal predecessors, (9004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3414 states to 3414 states and 9004 transitions. [2024-02-09 23:26:14,231 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3414 states and 9004 transitions. [2024-02-09 23:26:14,231 INFO L428 stractBuchiCegarLoop]: Abstraction has 3414 states and 9004 transitions. [2024-02-09 23:26:14,231 INFO L335 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-02-09 23:26:14,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3414 states and 9004 transitions. [2024-02-09 23:26:14,241 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 604 [2024-02-09 23:26:14,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:26:14,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:26:14,241 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:14,242 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:14,242 INFO L748 eck$LassoCheckResult]: Stem: 193869#[$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[] 193811#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 193813#[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] 194401#[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] 194575#[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] 195129#[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] 195185#[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] 194587#[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] 194589#[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[] 194149#[L43, 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] 194153#[ULTIMATE.startFINAL, L43, 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] 195793#[L43, ULTIMATE.startFINAL, L54]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[] 199491#[ULTIMATE.startFINAL, L44, L54]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] 199133#[ULTIMATE.startFINAL, L38, L54]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] 199113#[ULTIMATE.startFINAL, L39, L54]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] 199107#[ULTIMATE.startFINAL, L67, 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] 199445#[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] 199433#[ULTIMATE.startFINAL, L67, L68-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] 196821#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:14,242 INFO L750 eck$LassoCheckResult]: Loop: 196821#[L68-1, ULTIMATE.startFINAL, L68-1]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] 196817#[L68-1, ULTIMATE.startFINAL, L54-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] 196805#[ULTIMATE.startFINAL, L39-1, L54-1]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] 197701#[L55, ULTIMATE.startFINAL, L39-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] 197703#[L40, ULTIMATE.startFINAL, L55]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[] 198321#[L43, 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[] 198159#[L43, ULTIMATE.startFINAL, L58]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[] 193773#[ULTIMATE.startFINAL, L44, L58]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] 193901#[ULTIMATE.startFINAL, L38, L58]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] 194473#[ULTIMATE.startFINAL, L58, L39]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] 193909#[ULTIMATE.startFINAL, L67, 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[] 193911#[ULTIMATE.startFINAL, L67, L59]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] 194211#[ULTIMATE.startFINAL, L53, L67]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] 194279#[ULTIMATE.startFINAL, L67, 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] 194541#[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] 199889#[ULTIMATE.startFINAL, L67, L68-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] 196821#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:14,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:14,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1708322470, now seen corresponding path program 13 times [2024-02-09 23:26:14,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:14,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947967281] [2024-02-09 23:26:14,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:14,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:14,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:14,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:14,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1403936977, now seen corresponding path program 2 times [2024-02-09 23:26:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:14,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305570554] [2024-02-09 23:26:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:14,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:14,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:14,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:14,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:14,259 INFO L85 PathProgramCache]: Analyzing trace with hash 402957268, now seen corresponding path program 2 times [2024-02-09 23:26:14,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:14,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769420601] [2024-02-09 23:26:14,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:14,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:14,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:14,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:14,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:14,985 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:26:14,985 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:26:14,985 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:26:14,985 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:26:14,985 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:26:14,985 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:14,985 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:26:14,985 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:26:14,985 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration24_Lasso [2024-02-09 23:26:14,985 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:26:14,985 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:26:14,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:14,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:15,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:15,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:15,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:15,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:16,436 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2024-02-09 23:26:16,438 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2024-02-09 23:26:17,094 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:26:17,094 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:26:17,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:17,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:17,097 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:17,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2024-02-09 23:26:17,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:17,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:17,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:17,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:17,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:17,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:17,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:17,109 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:17,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2024-02-09 23:26:17,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:17,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:17,112 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:17,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2024-02-09 23:26:17,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:17,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:17,121 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:26:17,121 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2024-02-09 23:26:17,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:17,170 INFO L401 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2024-02-09 23:26:17,170 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2024-02-09 23:26:17,275 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:26:17,388 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2024-02-09 23:26:17,388 INFO L444 ModelExtractionUtils]: 51 out of 78 variables were initially zero. Simplification set additionally 21 variables to zero. [2024-02-09 23:26:17,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:17,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:17,393 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:17,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2024-02-09 23:26:17,395 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:26:17,404 INFO L438 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2024-02-09 23:26:17,404 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:26:17,404 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerThread1of1ForFork1_steal_num#1, cnt) = 3*N + 2*workerThread1of1ForFork1_steal_num#1 - 2*cnt Supporting invariants [-2*cnt + 3*N >= 0] [2024-02-09 23:26:17,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2024-02-09 23:26:17,414 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:26:17,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:17,440 WARN L260 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2024-02-09 23:26:17,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:17,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-09 23:26:17,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:17,986 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 6 loop predicates [2024-02-09 23:26:17,986 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3414 states and 9004 transitions. cyclomatic complexity: 5727 Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:18,093 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3414 states and 9004 transitions. cyclomatic complexity: 5727. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 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 3845 states and 9889 transitions. Complement of second has 9 states. [2024-02-09 23:26:18,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2024-02-09 23:26:18,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:18,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:18,094 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:18,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:18,124 WARN L260 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2024-02-09 23:26:18,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:18,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-09 23:26:18,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:18,766 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 7 loop predicates [2024-02-09 23:26:18,766 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3414 states and 9004 transitions. cyclomatic complexity: 5727 Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:18,869 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3414 states and 9004 transitions. cyclomatic complexity: 5727. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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 3845 states and 9889 transitions. Complement of second has 9 states. [2024-02-09 23:26:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2024-02-09 23:26:18,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:18,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:18,870 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:18,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:18,900 WARN L260 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2024-02-09 23:26:18,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:19,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:19,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-09 23:26:19,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:19,449 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 6 loop predicates [2024-02-09 23:26:19,449 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3414 states and 9004 transitions. cyclomatic complexity: 5727 Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:20,240 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3414 states and 9004 transitions. cyclomatic complexity: 5727. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 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 9324 states and 23139 transitions. Complement of second has 62 states. [2024-02-09 23:26:20,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 13 stem states 7 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:20,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 204 transitions. [2024-02-09 23:26:20,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 204 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:20,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:20,241 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:20,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:20,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:26:20,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:20,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-09 23:26:20,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:20,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:20,692 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.9 stem predicates 6 loop predicates [2024-02-09 23:26:20,692 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3414 states and 9004 transitions. cyclomatic complexity: 5727 Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:21,501 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3414 states and 9004 transitions. cyclomatic complexity: 5727. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 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 10345 states and 26321 transitions. Complement of second has 52 states. [2024-02-09 23:26:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 24 states 12 stem states 10 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 216 transitions. [2024-02-09 23:26:21,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 216 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:21,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:21,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 216 transitions. Stem has 34 letters. Loop has 16 letters. [2024-02-09 23:26:21,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:21,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 216 transitions. Stem has 18 letters. Loop has 32 letters. [2024-02-09 23:26:21,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:21,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10345 states and 26321 transitions. [2024-02-09 23:26:21,548 INFO L131 ngComponentsAnalysis]: Automaton has 56 accepting balls. 1256 [2024-02-09 23:26:21,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10345 states to 8853 states and 22682 transitions. [2024-02-09 23:26:21,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3535 [2024-02-09 23:26:21,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3781 [2024-02-09 23:26:21,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8853 states and 22682 transitions. [2024-02-09 23:26:21,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:26:21,630 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8853 states and 22682 transitions. [2024-02-09 23:26:21,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8853 states and 22682 transitions. [2024-02-09 23:26:21,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8853 to 6299. [2024-02-09 23:26:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6299 states, 6299 states have (on average 2.620574694395936) internal successors, (16507), 6298 states have internal predecessors, (16507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 16507 transitions. [2024-02-09 23:26:21,737 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6299 states and 16507 transitions. [2024-02-09 23:26:21,737 INFO L428 stractBuchiCegarLoop]: Abstraction has 6299 states and 16507 transitions. [2024-02-09 23:26:21,737 INFO L335 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-02-09 23:26:21,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6299 states and 16507 transitions. [2024-02-09 23:26:21,758 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 1008 [2024-02-09 23:26:21,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:26:21,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:26:21,759 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:21,759 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:21,759 INFO L748 eck$LassoCheckResult]: Stem: 228762#[$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[] 228710#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 228712#[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] 229296#[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] 229520#[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] 230564#[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] 230566#[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] 230750#[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] 230746#[L40, 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] 230748#[L40, 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] 234014#[L40, ULTIMATE.startFINAL, L54]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[] 235020#[L43, ULTIMATE.startFINAL, L54]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[] 235858#[ULTIMATE.startFINAL, L44, L54]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] 238208#[ULTIMATE.startFINAL, L38, L54]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] 238308#[ULTIMATE.startFINAL, L39, L54]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] 239574#[ULTIMATE.startFINAL, L67, 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] 239960#[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] 239956#[ULTIMATE.startFINAL, L67, L68-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] 231142#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:21,759 INFO L750 eck$LassoCheckResult]: Loop: 231142#[L68-1, ULTIMATE.startFINAL, L68-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] 231146#[ULTIMATE.startFINAL, L39-1, L68-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] 231006#[L40, ULTIMATE.startFINAL, L68-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[] 231010#[L43, ULTIMATE.startFINAL, L68-1]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] 229762#[L43, ULTIMATE.startFINAL, L54-1]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] 229764#[L43, ULTIMATE.startFINAL, L55]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[] 229300#[ULTIMATE.startFINAL, L55, L44]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] 240412#[ULTIMATE.startFINAL, L55, 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] 240414#[ULTIMATE.startFINAL, L55, L39]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[] 239206#[ULTIMATE.startFINAL, L58, L39]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] 240532#[ULTIMATE.startFINAL, L67, 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[] 240530#[ULTIMATE.startFINAL, L67, L59]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] 240484#[ULTIMATE.startFINAL, L53, L67]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] 240026#[ULTIMATE.startFINAL, L67, 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] 235660#[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] 234382#[ULTIMATE.startFINAL, L67, L68-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] 231142#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:21,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:21,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1748754042, now seen corresponding path program 14 times [2024-02-09 23:26:21,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:21,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302761380] [2024-02-09 23:26:21,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:21,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:21,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:21,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:21,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:21,771 INFO L85 PathProgramCache]: Analyzing trace with hash 255832573, now seen corresponding path program 3 times [2024-02-09 23:26:21,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:21,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257675008] [2024-02-09 23:26:21,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:21,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:21,775 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:21,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:21,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:21,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1826761090, now seen corresponding path program 3 times [2024-02-09 23:26:21,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:21,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366810182] [2024-02-09 23:26:21,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:21,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:21,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:21,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:22,388 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:26:22,388 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:26:22,388 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:26:22,389 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:26:22,389 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:26:22,389 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:22,389 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:26:22,389 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:26:22,389 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration25_Lasso [2024-02-09 23:26:22,389 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:26:22,389 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:26:22,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:23,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:23,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:23,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:23,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:23,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:23,711 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2024-02-09 23:26:23,711 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2024-02-09 23:26:24,247 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:26:24,247 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:26:24,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:24,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:24,248 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:24,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2024-02-09 23:26:24,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:24,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:24,258 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:26:24,258 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2024-02-09 23:26:24,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:24,314 INFO L401 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2024-02-09 23:26:24,315 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2024-02-09 23:26:24,466 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:26:24,609 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2024-02-09 23:26:24,609 INFO L444 ModelExtractionUtils]: 53 out of 78 variables were initially zero. Simplification set additionally 19 variables to zero. [2024-02-09 23:26:24,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:24,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:24,613 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:24,620 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:26:24,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2024-02-09 23:26:24,647 INFO L438 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2024-02-09 23:26:24,647 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:26:24,647 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 [3*N - 2*cnt >= 0] [2024-02-09 23:26:24,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2024-02-09 23:26:24,656 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:26:24,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:24,680 WARN L260 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2024-02-09 23:26:24,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:25,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-09 23:26:25,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:25,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-09 23:26:25,226 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 6 loop predicates [2024-02-09 23:26:25,226 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6299 states and 16507 transitions. cyclomatic complexity: 10441 Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:25,335 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6299 states and 16507 transitions. cyclomatic complexity: 10441. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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 6740 states and 17405 transitions. Complement of second has 9 states. [2024-02-09 23:26:25,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:25,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:25,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2024-02-09 23:26:25,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:25,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:25,336 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:25,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:25,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:26:25,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:25,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-09 23:26:25,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:25,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:25,861 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 6 loop predicates [2024-02-09 23:26:25,861 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6299 states and 16507 transitions. cyclomatic complexity: 10441 Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:25,959 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6299 states and 16507 transitions. cyclomatic complexity: 10441. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 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 6740 states and 17405 transitions. Complement of second has 9 states. [2024-02-09 23:26:25,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:25,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2024-02-09 23:26:25,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:25,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:25,960 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:25,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:25,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:26:25,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:26,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-09 23:26:26,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:26,445 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 6 loop predicates [2024-02-09 23:26:26,445 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6299 states and 16507 transitions. cyclomatic complexity: 10441 Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:27,135 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6299 states and 16507 transitions. cyclomatic complexity: 10441. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 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 18012 states and 45133 transitions. Complement of second has 55 states. [2024-02-09 23:26:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 13 stem states 8 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:27,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:27,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2024-02-09 23:26:27,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 234 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:27,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:27,137 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:27,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:27,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-09 23:26:27,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:27,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-09 23:26:27,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:27,622 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.8 stem predicates 6 loop predicates [2024-02-09 23:26:27,622 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6299 states and 16507 transitions. cyclomatic complexity: 10441 Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:28,525 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6299 states and 16507 transitions. cyclomatic complexity: 10441. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 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 18373 states and 46432 transitions. Complement of second has 60 states. [2024-02-09 23:26:28,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 12 stem states 11 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 249 transitions. [2024-02-09 23:26:28,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 249 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:28,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:28,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 249 transitions. Stem has 34 letters. Loop has 16 letters. [2024-02-09 23:26:28,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:28,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 249 transitions. Stem has 18 letters. Loop has 32 letters. [2024-02-09 23:26:28,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:28,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18373 states and 46432 transitions. [2024-02-09 23:26:28,591 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 1438 [2024-02-09 23:26:28,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18373 states to 14380 states and 36533 transitions. [2024-02-09 23:26:28,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5268 [2024-02-09 23:26:28,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5607 [2024-02-09 23:26:28,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14380 states and 36533 transitions. [2024-02-09 23:26:28,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:26:28,635 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14380 states and 36533 transitions. [2024-02-09 23:26:28,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14380 states and 36533 transitions. [2024-02-09 23:26:28,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14380 to 8191. [2024-02-09 23:26:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8191 states, 8191 states have (on average 2.610792333048468) internal successors, (21385), 8190 states have internal predecessors, (21385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8191 states to 8191 states and 21385 transitions. [2024-02-09 23:26:28,803 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8191 states and 21385 transitions. [2024-02-09 23:26:28,803 INFO L428 stractBuchiCegarLoop]: Abstraction has 8191 states and 21385 transitions. [2024-02-09 23:26:28,803 INFO L335 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-02-09 23:26:28,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8191 states and 21385 transitions. [2024-02-09 23:26:28,827 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 1296 [2024-02-09 23:26:28,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:26:28,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:26:28,828 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:28,828 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:28,828 INFO L748 eck$LassoCheckResult]: Stem: 291924#[$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[] 291876#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 291878#[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] 292470#[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] 292686#[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] 292682#[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] 292588#[L68-1, 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] 292592#[L68-1, 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] 300234#[L68-1, ULTIMATE.startFINAL, L54]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] 301462#[ULTIMATE.startFINAL, L39-1, L54]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] 301214#[L40, 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] 300878#[L40, L67, ULTIMATE.startFINAL]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] 300856#[L40, ULTIMATE.startFINAL, L68-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[] 300824#[L43, ULTIMATE.startFINAL, L68-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[] 300814#[ULTIMATE.startFINAL, L44, L68-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] 300796#[ULTIMATE.startFINAL, L38, L68-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] 300758#[ULTIMATE.startFINAL, L68-1, L39]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] 300754#[ULTIMATE.startFINAL, L67, L68-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] 294268#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:28,829 INFO L750 eck$LassoCheckResult]: Loop: 294268#[L68-1, ULTIMATE.startFINAL, L68-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] 294238#[ULTIMATE.startFINAL, L39-1, L68-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] 294242#[L40, ULTIMATE.startFINAL, L68-1]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] 303930#[L40, ULTIMATE.startFINAL, L54-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[] 292708#[L43, ULTIMATE.startFINAL, L54-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[] 292948#[ULTIMATE.startFINAL, L54-1, L44]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] 293006#[ULTIMATE.startFINAL, L55, L44]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] 307134#[ULTIMATE.startFINAL, L55, L38]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[] 292048#[ULTIMATE.startFINAL, L38, L58]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] 292652#[ULTIMATE.startFINAL, L58, L39]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] 292654#[ULTIMATE.startFINAL, L67, 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[] 292544#[ULTIMATE.startFINAL, L67, L59]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] 292442#[ULTIMATE.startFINAL, L53, L67]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] 292140#[ULTIMATE.startFINAL, L67, 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] 305574#[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] 307392#[ULTIMATE.startFINAL, L67, L68-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] 294268#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:28,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:28,829 INFO L85 PathProgramCache]: Analyzing trace with hash 33627338, now seen corresponding path program 15 times [2024-02-09 23:26:28,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:28,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168328523] [2024-02-09 23:26:28,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:28,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:28,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:28,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:28,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:28,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2127176643, now seen corresponding path program 4 times [2024-02-09 23:26:28,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:28,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732291151] [2024-02-09 23:26:28,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:28,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:28,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:28,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:28,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:28,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1215467148, now seen corresponding path program 4 times [2024-02-09 23:26:28,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:28,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177621510] [2024-02-09 23:26:28,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:28,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:28,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:28,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:29,498 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:26:29,498 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:26:29,498 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:26:29,498 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:26:29,498 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:26:29,498 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:29,498 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:26:29,498 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:26:29,498 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration26_Lasso [2024-02-09 23:26:29,498 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:26:29,498 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:26:29,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:29,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:29,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:30,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:30,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:30,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:30,868 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-02-09 23:26:30,869 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2024-02-09 23:26:31,440 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:26:31,440 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:26:31,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:31,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:31,448 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:31,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2024-02-09 23:26:31,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:31,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:31,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:31,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:31,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:31,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:31,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:31,474 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:31,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:31,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:31,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:31,478 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:31,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:31,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2024-02-09 23:26:31,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:31,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:31,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:31,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:31,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:31,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:31,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:31,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2024-02-09 23:26:31,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:31,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:31,497 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:31,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2024-02-09 23:26:31,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:31,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:31,505 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:26:31,505 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2024-02-09 23:26:31,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:31,549 INFO L401 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2024-02-09 23:26:31,549 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2024-02-09 23:26:31,676 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:26:31,753 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-02-09 23:26:31,753 INFO L444 ModelExtractionUtils]: 62 out of 78 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-02-09 23:26:31,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:31,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:31,754 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:31,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2024-02-09 23:26:31,756 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:26:31,764 INFO L438 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2024-02-09 23:26:31,764 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:26:31,764 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerWithAssertThread1of1ForFork0_steal_num#1) = 2*N - 1*cnt + 2*workerWithAssertThread1of1ForFork0_steal_num#1 Supporting invariants [2*N - 1*cnt >= 0] [2024-02-09 23:26:31,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2024-02-09 23:26:31,773 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:26:31,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:31,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:26:31,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:31,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:32,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-09 23:26:32,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:32,389 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 7 loop predicates [2024-02-09 23:26:32,389 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8191 states and 21385 transitions. cyclomatic complexity: 13495 Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:32,997 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8191 states and 21385 transitions. cyclomatic complexity: 13495. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 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 17235 states and 43101 transitions. Complement of second has 31 states. [2024-02-09 23:26:32,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 4 stem states 12 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 136 transitions. [2024-02-09 23:26:32,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 136 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:32,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:32,998 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:33,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:33,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:26:33,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:33,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-09 23:26:33,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:33,504 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 7 loop predicates [2024-02-09 23:26:33,505 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8191 states and 21385 transitions. cyclomatic complexity: 13495 Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:34,055 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8191 states and 21385 transitions. cyclomatic complexity: 13495. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 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 17235 states and 43101 transitions. Complement of second has 31 states. [2024-02-09 23:26:34,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 4 stem states 12 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:34,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:34,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 136 transitions. [2024-02-09 23:26:34,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 136 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:34,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:34,056 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:34,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:34,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 15 conjunts are in the unsatisfiable core [2024-02-09 23:26:34,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:34,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 12 conjunts are in the unsatisfiable core [2024-02-09 23:26:34,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:34,637 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 7 loop predicates [2024-02-09 23:26:34,637 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8191 states and 21385 transitions. cyclomatic complexity: 13495 Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:35,613 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8191 states and 21385 transitions. cyclomatic complexity: 13495. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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 22336 states and 56417 transitions. Complement of second has 97 states. [2024-02-09 23:26:35,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 30 states 16 stem states 12 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 279 transitions. [2024-02-09 23:26:35,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 279 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:35,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:35,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 279 transitions. Stem has 34 letters. Loop has 16 letters. [2024-02-09 23:26:35,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:35,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 279 transitions. Stem has 18 letters. Loop has 32 letters. [2024-02-09 23:26:35,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:35,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22336 states and 56417 transitions. [2024-02-09 23:26:35,694 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 1638 [2024-02-09 23:26:35,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22336 states to 18127 states and 46061 transitions. [2024-02-09 23:26:35,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5690 [2024-02-09 23:26:35,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6191 [2024-02-09 23:26:35,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18127 states and 46061 transitions. [2024-02-09 23:26:35,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:26:35,755 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18127 states and 46061 transitions. [2024-02-09 23:26:35,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states and 46061 transitions. [2024-02-09 23:26:36,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 13140. [2024-02-09 23:26:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13140 states, 13140 states have (on average 2.596194824961948) internal successors, (34114), 13139 states have internal predecessors, (34114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:36,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13140 states to 13140 states and 34114 transitions. [2024-02-09 23:26:36,152 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13140 states and 34114 transitions. [2024-02-09 23:26:36,152 INFO L428 stractBuchiCegarLoop]: Abstraction has 13140 states and 34114 transitions. [2024-02-09 23:26:36,152 INFO L335 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-02-09 23:26:36,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13140 states and 34114 transitions. [2024-02-09 23:26:36,191 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 1344 [2024-02-09 23:26:36,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:26:36,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:26:36,192 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:36,192 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:36,192 INFO L748 eck$LassoCheckResult]: Stem: 365737#[$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[] 365687#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 365689#[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] 366357#[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] 366107#[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] 366109#[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] 366253#[L68-1, 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] 366491#[L68-1, 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] 368823#[L68-1, 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] 372911#[L68-1, L67, ULTIMATE.startFINAL]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] 372647#[L68-1, ULTIMATE.startFINAL, L68-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] 372649#[ULTIMATE.startFINAL, L39-1, L68-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] 382189#[L40, ULTIMATE.startFINAL, L68-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[] 378349#[L43, ULTIMATE.startFINAL, L68-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[] 385019#[ULTIMATE.startFINAL, L44, L68-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] 385013#[ULTIMATE.startFINAL, L38, L68-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] 385005#[ULTIMATE.startFINAL, L68-1, L39]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] 389045#[ULTIMATE.startFINAL, L67, L68-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] 374473#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:36,192 INFO L750 eck$LassoCheckResult]: Loop: 374473#[L68-1, ULTIMATE.startFINAL, L68-1]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] 374475#[L68-1, ULTIMATE.startFINAL, L54-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] 386709#[ULTIMATE.startFINAL, L39-1, L54-1]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] 386711#[L55, ULTIMATE.startFINAL, L39-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] 386925#[L40, ULTIMATE.startFINAL, L55]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[] 386563#[L43, 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[] 386565#[L43, ULTIMATE.startFINAL, L58]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[] 386495#[ULTIMATE.startFINAL, L44, 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[] 386497#[ULTIMATE.startFINAL, L44, L59]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] 386407#[ULTIMATE.startFINAL, L53, L44]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] 367067#[ULTIMATE.startFINAL, L44, 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] 367035#[L67, ULTIMATE.startFINAL, L44]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] 386329#[L67, 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] 386333#[L67, ULTIMATE.startFINAL, L39]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] 384691#[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] 384693#[ULTIMATE.startFINAL, L67, L68-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] 374473#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:36,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:36,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1420195702, now seen corresponding path program 16 times [2024-02-09 23:26:36,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:36,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724540706] [2024-02-09 23:26:36,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:36,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:36,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:36,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:36,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:36,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1757646985, now seen corresponding path program 5 times [2024-02-09 23:26:36,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:36,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974470804] [2024-02-09 23:26:36,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:36,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:36,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:36,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:36,414 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1426790638, now seen corresponding path program 5 times [2024-02-09 23:26:36,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:36,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450096378] [2024-02-09 23:26:36,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:36,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:36,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:36,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:37,133 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:26:37,133 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:26:37,133 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:26:37,133 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:26:37,133 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:26:37,133 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:37,133 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:26:37,133 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:26:37,133 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration27_Lasso [2024-02-09 23:26:37,133 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:26:37,133 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:26:37,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:38,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:38,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:38,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:38,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:38,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:38,403 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-02-09 23:26:38,404 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-02-09 23:26:38,936 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:26:38,937 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:26:38,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:38,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:38,940 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:38,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2024-02-09 23:26:38,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:38,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:38,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:38,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:38,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:38,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:38,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:38,952 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:38,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2024-02-09 23:26:38,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:38,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:38,956 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:38,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2024-02-09 23:26:38,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:38,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:38,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:26:38,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:38,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:38,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:38,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:26:38,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:26:38,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:38,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2024-02-09 23:26:38,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:38,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:38,967 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:38,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2024-02-09 23:26:38,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:38,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:38,976 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:26:38,976 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2024-02-09 23:26:38,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:39,020 INFO L401 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2024-02-09 23:26:39,020 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2024-02-09 23:26:39,119 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:26:39,248 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2024-02-09 23:26:39,248 INFO L444 ModelExtractionUtils]: 55 out of 78 variables were initially zero. Simplification set additionally 17 variables to zero. [2024-02-09 23:26:39,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:39,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:39,249 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:39,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2024-02-09 23:26:39,251 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:26:39,261 INFO L438 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2024-02-09 23:26:39,261 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:26:39,261 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerWithAssertThread1of1ForFork0_steal_num#1, N, cnt) = 2*workerWithAssertThread1of1ForFork0_steal_num#1 + 1*N - 1*cnt Supporting invariants [1*N - 1*cnt >= 0] [2024-02-09 23:26:39,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2024-02-09 23:26:39,269 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:26:39,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:39,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:26:39,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:39,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2024-02-09 23:26:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:39,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-09 23:26:39,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:39,618 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 6 loop predicates [2024-02-09 23:26:39,618 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13140 states and 34114 transitions. cyclomatic complexity: 21429 Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:40,092 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13140 states and 34114 transitions. cyclomatic complexity: 21429. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 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 15943 states and 41419 transitions. Complement of second has 31 states. [2024-02-09 23:26:40,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 4 stem states 12 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 135 transitions. [2024-02-09 23:26:40,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 135 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:40,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:40,093 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:40,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:40,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:26:40,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:40,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-09 23:26:40,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:40,383 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 6 loop predicates [2024-02-09 23:26:40,383 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13140 states and 34114 transitions. cyclomatic complexity: 21429 Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:40,865 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13140 states and 34114 transitions. cyclomatic complexity: 21429. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 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 15943 states and 41419 transitions. Complement of second has 31 states. [2024-02-09 23:26:40,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 4 stem states 12 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 135 transitions. [2024-02-09 23:26:40,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 135 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:40,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:40,866 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:40,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:40,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:26:40,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:41,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-09 23:26:41,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:41,173 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 6 loop predicates [2024-02-09 23:26:41,173 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13140 states and 34114 transitions. cyclomatic complexity: 21429 Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:41,670 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13140 states and 34114 transitions. cyclomatic complexity: 21429. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 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 28662 states and 73213 transitions. Complement of second has 30 states. [2024-02-09 23:26:41,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 4 stem states 12 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 159 transitions. [2024-02-09 23:26:41,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 159 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:41,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:41,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 159 transitions. Stem has 34 letters. Loop has 16 letters. [2024-02-09 23:26:41,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:41,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 159 transitions. Stem has 18 letters. Loop has 32 letters. [2024-02-09 23:26:41,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:41,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28662 states and 73213 transitions. [2024-02-09 23:26:41,790 INFO L131 ngComponentsAnalysis]: Automaton has 82 accepting balls. 2690 [2024-02-09 23:26:41,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28662 states to 22107 states and 56972 transitions. [2024-02-09 23:26:41,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5919 [2024-02-09 23:26:41,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6245 [2024-02-09 23:26:41,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22107 states and 56972 transitions. [2024-02-09 23:26:41,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:26:41,865 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22107 states and 56972 transitions. [2024-02-09 23:26:41,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22107 states and 56972 transitions. [2024-02-09 23:26:42,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22107 to 16802. [2024-02-09 23:26:42,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16802 states, 16802 states have (on average 2.6474229258421618) internal successors, (44482), 16801 states have internal predecessors, (44482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16802 states to 16802 states and 44482 transitions. [2024-02-09 23:26:42,291 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16802 states and 44482 transitions. [2024-02-09 23:26:42,291 INFO L428 stractBuchiCegarLoop]: Abstraction has 16802 states and 44482 transitions. [2024-02-09 23:26:42,291 INFO L335 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2024-02-09 23:26:42,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16802 states and 44482 transitions. [2024-02-09 23:26:42,347 INFO L131 ngComponentsAnalysis]: Automaton has 56 accepting balls. 1964 [2024-02-09 23:26:42,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:26:42,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:26:42,348 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:42,348 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:42,348 INFO L748 eck$LassoCheckResult]: Stem: 453092#[$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[] 453046#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 453048#[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] 453616#[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] 453840#[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] 454234#[L67, 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] 454236#[ULTIMATE.startFINAL, L53, L67]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] 455936#[ULTIMATE.startFINAL, L67, L54]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] 456352#[L68-1, ULTIMATE.startFINAL, L54]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] 456338#[ULTIMATE.startFINAL, L39-1, L54]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] 456340#[L40, ULTIMATE.startFINAL, L54]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[] 456312#[L43, ULTIMATE.startFINAL, L54]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[] 456314#[ULTIMATE.startFINAL, L44, L54]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] 457156#[ULTIMATE.startFINAL, L38, L54]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] 457158#[ULTIMATE.startFINAL, L39, L54]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] 457388#[ULTIMATE.startFINAL, L67, 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] 457384#[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] 474604#[ULTIMATE.startFINAL, L67, L68-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] 456866#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:42,349 INFO L750 eck$LassoCheckResult]: Loop: 456866#[L68-1, ULTIMATE.startFINAL, L68-1]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] 456854#[L68-1, ULTIMATE.startFINAL, L54-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] 482052#[ULTIMATE.startFINAL, L39-1, L54-1]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] 482044#[L55, ULTIMATE.startFINAL, L39-1]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[] 481942#[ULTIMATE.startFINAL, L39-1, 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[] 481930#[ULTIMATE.startFINAL, L39-1, L59]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] 481918#[ULTIMATE.startFINAL, L53, L39-1]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] 481622#[ULTIMATE.startFINAL, L39-1, 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] 480724#[L67, ULTIMATE.startFINAL, L39-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] 481906#[L40, L67, 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[] 454210#[L67, 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[] 454214#[L67, ULTIMATE.startFINAL, L44]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] 454058#[L67, ULTIMATE.startFINAL, L38]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] 454060#[ULTIMATE.startFINAL, L38, L68-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] 483770#[ULTIMATE.startFINAL, L68-1, L39]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] 481842#[ULTIMATE.startFINAL, L67, L68-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] 456866#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:42,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:42,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1813308954, now seen corresponding path program 17 times [2024-02-09 23:26:42,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:42,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84405487] [2024-02-09 23:26:42,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:42,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:42,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:42,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:42,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:42,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2080854161, now seen corresponding path program 6 times [2024-02-09 23:26:42,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:42,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986018946] [2024-02-09 23:26:42,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:42,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:42,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:42,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:42,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:42,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1601872044, now seen corresponding path program 6 times [2024-02-09 23:26:42,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:42,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634594909] [2024-02-09 23:26:42,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:42,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:42,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:42,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:43,302 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:26:43,302 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:26:43,302 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:26:43,302 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:26:43,302 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:26:43,302 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:43,302 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:26:43,302 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:26:43,302 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration28_Lasso [2024-02-09 23:26:43,302 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:26:43,303 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:26:43,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:43,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:43,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:44,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:44,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:44,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-09 23:26:44,628 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2024-02-09 23:26:44,629 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2024-02-09 23:26:45,336 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:26:45,337 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:26:45,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:45,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:45,337 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:45,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2024-02-09 23:26:45,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:45,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:45,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:45,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:45,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:45,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:45,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:45,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:45,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2024-02-09 23:26:45,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:45,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:45,367 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:45,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2024-02-09 23:26:45,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:45,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:45,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:45,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:45,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:45,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:45,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:45,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:45,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2024-02-09 23:26:45,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:45,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:45,410 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:45,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2024-02-09 23:26:45,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:45,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:45,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:45,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:45,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:45,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:45,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:45,422 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:45,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2024-02-09 23:26:45,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:45,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:45,425 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:45,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2024-02-09 23:26:45,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:45,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:45,433 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:26:45,433 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2024-02-09 23:26:45,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:45,484 INFO L401 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2024-02-09 23:26:45,484 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2024-02-09 23:26:45,591 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:26:45,737 INFO L443 ModelExtractionUtils]: Simplification made 30 calls to the SMT solver. [2024-02-09 23:26:45,737 INFO L444 ModelExtractionUtils]: 52 out of 78 variables were initially zero. Simplification set additionally 20 variables to zero. [2024-02-09 23:26:45,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:45,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:45,738 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:45,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2024-02-09 23:26:45,740 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:26:45,748 INFO L438 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2024-02-09 23:26:45,749 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:26:45,749 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerWithAssertThread1of1ForFork0_steal_num#1, cnt, N) = 2*workerWithAssertThread1of1ForFork0_steal_num#1 - 1*cnt + 2*N Supporting invariants [-1*cnt + 2*N >= 0] [2024-02-09 23:26:45,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:45,757 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:26:45,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:45,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:26:45,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:45,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:46,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 12 conjunts are in the unsatisfiable core [2024-02-09 23:26:46,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:46,268 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 7 loop predicates [2024-02-09 23:26:46,268 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16802 states and 44482 transitions. cyclomatic complexity: 28211 Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:46,543 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16802 states and 44482 transitions. cyclomatic complexity: 28211. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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 19363 states and 50312 transitions. Complement of second has 20 states. [2024-02-09 23:26:46,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 5 stem states 6 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 79 transitions. [2024-02-09 23:26:46,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 79 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:46,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:46,544 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:46,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:46,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 16 conjunts are in the unsatisfiable core [2024-02-09 23:26:46,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:46,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-09 23:26:46,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:47,167 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 7 loop predicates [2024-02-09 23:26:47,167 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16802 states and 44482 transitions. cyclomatic complexity: 28211 Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:47,447 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16802 states and 44482 transitions. cyclomatic complexity: 28211. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 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 19363 states and 50312 transitions. Complement of second has 20 states. [2024-02-09 23:26:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 5 stem states 6 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:47,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 79 transitions. [2024-02-09 23:26:47,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 79 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:47,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:47,448 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:47,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:47,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:26:47,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:47,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-09 23:26:47,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:48,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:48,004 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 7 loop predicates [2024-02-09 23:26:48,004 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16802 states and 44482 transitions. cyclomatic complexity: 28211 Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:49,070 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16802 states and 44482 transitions. cyclomatic complexity: 28211. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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 26074 states and 67141 transitions. Complement of second has 56 states. [2024-02-09 23:26:49,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 31 states 13 stem states 16 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 261 transitions. [2024-02-09 23:26:49,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 261 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:49,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:49,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 261 transitions. Stem has 34 letters. Loop has 16 letters. [2024-02-09 23:26:49,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:49,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 261 transitions. Stem has 18 letters. Loop has 32 letters. [2024-02-09 23:26:49,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:49,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26074 states and 67141 transitions. [2024-02-09 23:26:49,193 INFO L131 ngComponentsAnalysis]: Automaton has 116 accepting balls. 2638 [2024-02-09 23:26:49,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26074 states to 21768 states and 56848 transitions. [2024-02-09 23:26:49,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6435 [2024-02-09 23:26:49,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6814 [2024-02-09 23:26:49,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21768 states and 56848 transitions. [2024-02-09 23:26:49,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:26:49,274 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21768 states and 56848 transitions. [2024-02-09 23:26:49,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21768 states and 56848 transitions. [2024-02-09 23:26:49,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21768 to 17764. [2024-02-09 23:26:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17764 states, 17764 states have (on average 2.6554829993244766) internal successors, (47172), 17763 states have internal predecessors, (47172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:49,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17764 states to 17764 states and 47172 transitions. [2024-02-09 23:26:49,653 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17764 states and 47172 transitions. [2024-02-09 23:26:49,653 INFO L428 stractBuchiCegarLoop]: Abstraction has 17764 states and 47172 transitions. [2024-02-09 23:26:49,653 INFO L335 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2024-02-09 23:26:49,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17764 states and 47172 transitions. [2024-02-09 23:26:49,711 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 2044 [2024-02-09 23:26:49,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:26:49,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:26:49,712 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:49,712 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:49,712 INFO L748 eck$LassoCheckResult]: Stem: 552058#[$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[] 552000#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 552002#[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] 552680#[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] 552432#[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] 552434#[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] 552572#[L68-1, 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] 552846#[L68-1, 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] 561564#[L68-1, 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] 571988#[L68-1, L67, ULTIMATE.startFINAL]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] 571990#[L68-1, ULTIMATE.startFINAL, L68-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] 578872#[ULTIMATE.startFINAL, L39-1, L68-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] 578850#[L40, ULTIMATE.startFINAL, L68-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[] 578852#[L43, ULTIMATE.startFINAL, L68-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[] 585268#[ULTIMATE.startFINAL, L44, L68-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] 585246#[ULTIMATE.startFINAL, L38, L68-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] 585238#[ULTIMATE.startFINAL, L68-1, L39]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] 579906#[ULTIMATE.startFINAL, L67, L68-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] 555646#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:49,712 INFO L750 eck$LassoCheckResult]: Loop: 555646#[L68-1, ULTIMATE.startFINAL, L68-1]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] 551718#[L68-1, ULTIMATE.startFINAL, L54-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] 551722#[ULTIMATE.startFINAL, L39-1, L54-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] 571978#[L40, ULTIMATE.startFINAL, L54-1]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] 583086#[L40, 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[] 562534#[L40, 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[] 572410#[L40, ULTIMATE.startFINAL, L59]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] 571798#[L40, ULTIMATE.startFINAL, L53]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[] 583044#[ULTIMATE.startFINAL, L43, L53]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[] 583038#[ULTIMATE.startFINAL, L53, L44]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] 583040#[ULTIMATE.startFINAL, L53, 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] 585008#[ULTIMATE.startFINAL, L53, L39]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] 584838#[ULTIMATE.startFINAL, L39, 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] 583368#[L67, ULTIMATE.startFINAL, L39]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] 584758#[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] 583140#[ULTIMATE.startFINAL, L67, L68-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] 555646#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:49,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:49,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1420195702, now seen corresponding path program 18 times [2024-02-09 23:26:49,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:49,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52623556] [2024-02-09 23:26:49,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:49,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:49,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:49,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:49,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:49,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1301360887, now seen corresponding path program 7 times [2024-02-09 23:26:49,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:49,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557611462] [2024-02-09 23:26:49,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:49,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:49,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:49,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:49,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:49,728 INFO L85 PathProgramCache]: Analyzing trace with hash -190831214, now seen corresponding path program 7 times [2024-02-09 23:26:49,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:49,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804926687] [2024-02-09 23:26:49,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:49,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:49,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:49,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:50,386 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:26:50,386 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:26:50,386 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:26:50,386 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:26:50,386 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:26:50,386 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:50,386 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:26:50,386 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:26:50,386 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration29_Lasso [2024-02-09 23:26:50,386 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:26:50,387 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:26:50,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:50,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:50,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:50,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:50,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:51,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:51,473 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-02-09 23:26:51,474 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2024-02-09 23:26:52,024 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:26:52,024 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:26:52,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:52,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:52,025 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:52,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2024-02-09 23:26:52,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:52,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:52,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:52,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:52,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:52,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:52,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:52,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:52,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:52,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:52,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:52,042 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:52,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2024-02-09 23:26:52,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:52,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:52,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:52,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:52,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:52,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:52,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:52,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:52,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2024-02-09 23:26:52,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:52,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:52,056 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:52,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2024-02-09 23:26:52,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:52,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:52,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:52,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:52,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:52,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:52,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:52,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:52,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:52,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:52,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:52,070 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:52,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2024-02-09 23:26:52,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:52,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:52,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:52,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:52,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:52,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:52,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:52,081 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:52,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:52,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:52,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:52,085 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:52,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2024-02-09 23:26:52,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:52,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:52,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:26:52,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:52,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:52,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:52,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:26:52,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:26:52,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:52,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2024-02-09 23:26:52,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:52,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:52,097 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:52,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2024-02-09 23:26:52,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:52,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:52,105 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:26:52,105 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2024-02-09 23:26:52,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:52,148 INFO L401 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2024-02-09 23:26:52,148 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2024-02-09 23:26:52,254 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:26:52,394 INFO L443 ModelExtractionUtils]: Simplification made 28 calls to the SMT solver. [2024-02-09 23:26:52,394 INFO L444 ModelExtractionUtils]: 52 out of 78 variables were initially zero. Simplification set additionally 20 variables to zero. [2024-02-09 23:26:52,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:52,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:52,395 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:52,398 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:26:52,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2024-02-09 23:26:52,407 INFO L438 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2024-02-09 23:26:52,407 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:26:52,407 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerWithAssertThread1of1ForFork0_steal_num#1) = 2*N - 1*cnt + 2*workerWithAssertThread1of1ForFork0_steal_num#1 Supporting invariants [-1*cnt + 2*N >= 0] [2024-02-09 23:26:52,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:52,416 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:26:52,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:52,439 WARN L260 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2024-02-09 23:26:52,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:52,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2024-02-09 23:26:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:52,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-09 23:26:52,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:53,134 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 7 loop predicates [2024-02-09 23:26:53,134 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17764 states and 47172 transitions. cyclomatic complexity: 29977 Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:53,338 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17764 states and 47172 transitions. cyclomatic complexity: 29977. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 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 19128 states and 50034 transitions. Complement of second has 15 states. [2024-02-09 23:26:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 4 stem states 4 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. [2024-02-09 23:26:53,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 55 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:53,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:53,339 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:53,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:53,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 15 conjunts are in the unsatisfiable core [2024-02-09 23:26:53,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:53,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-09 23:26:53,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:53,967 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 7 loop predicates [2024-02-09 23:26:53,967 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17764 states and 47172 transitions. cyclomatic complexity: 29977 Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:54,151 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17764 states and 47172 transitions. cyclomatic complexity: 29977. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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 19128 states and 50034 transitions. Complement of second has 15 states. [2024-02-09 23:26:54,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 4 stem states 4 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. [2024-02-09 23:26:54,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 55 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:54,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:54,152 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:54,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:54,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-09 23:26:54,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:54,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-09 23:26:54,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:54,741 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 7 loop predicates [2024-02-09 23:26:54,741 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17764 states and 47172 transitions. cyclomatic complexity: 29977 Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:55,595 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17764 states and 47172 transitions. cyclomatic complexity: 29977. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 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 26733 states and 69291 transitions. Complement of second has 71 states. [2024-02-09 23:26:55,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 24 states 9 stem states 13 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:55,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 221 transitions. [2024-02-09 23:26:55,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 221 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:55,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:55,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 221 transitions. Stem has 34 letters. Loop has 16 letters. [2024-02-09 23:26:55,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:55,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 221 transitions. Stem has 18 letters. Loop has 32 letters. [2024-02-09 23:26:55,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:55,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26733 states and 69291 transitions. [2024-02-09 23:26:55,741 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 2270 [2024-02-09 23:26:55,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26733 states to 24309 states and 63767 transitions. [2024-02-09 23:26:55,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7192 [2024-02-09 23:26:55,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7565 [2024-02-09 23:26:55,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24309 states and 63767 transitions. [2024-02-09 23:26:55,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:26:55,826 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24309 states and 63767 transitions. [2024-02-09 23:26:55,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24309 states and 63767 transitions. [2024-02-09 23:26:56,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24309 to 18277. [2024-02-09 23:26:56,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18277 states, 18277 states have (on average 2.6646057886961754) internal successors, (48701), 18276 states have internal predecessors, (48701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:56,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18277 states to 18277 states and 48701 transitions. [2024-02-09 23:26:56,107 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18277 states and 48701 transitions. [2024-02-09 23:26:56,107 INFO L428 stractBuchiCegarLoop]: Abstraction has 18277 states and 48701 transitions. [2024-02-09 23:26:56,107 INFO L335 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2024-02-09 23:26:56,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18277 states and 48701 transitions. [2024-02-09 23:26:56,162 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 2044 [2024-02-09 23:26:56,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:26:56,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:26:56,163 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:56,163 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:26:56,164 INFO L748 eck$LassoCheckResult]: Stem: 653110#[$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[] 653054#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 653056#[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] 653652#[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] 653436#[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] 653438#[L67, 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] 653576#[ULTIMATE.startFINAL, L53, L67]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] 654894#[ULTIMATE.startFINAL, L67, L54]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] 655112#[L68-1, 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] 681130#[L68-1, L67, ULTIMATE.startFINAL]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] 656120#[L68-1, ULTIMATE.startFINAL, L68-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] 656192#[ULTIMATE.startFINAL, L39-1, L68-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] 656246#[L40, ULTIMATE.startFINAL, L68-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[] 656068#[L43, ULTIMATE.startFINAL, L68-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[] 655880#[ULTIMATE.startFINAL, L44, L68-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] 678934#[ULTIMATE.startFINAL, L38, L68-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] 678922#[ULTIMATE.startFINAL, L68-1, L39]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] 678948#[ULTIMATE.startFINAL, L67, L68-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] 656312#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:56,164 INFO L750 eck$LassoCheckResult]: Loop: 656312#[L68-1, ULTIMATE.startFINAL, L68-1]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] 656316#[L68-1, ULTIMATE.startFINAL, L54-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] 684458#[ULTIMATE.startFINAL, L39-1, L54-1]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] 675964#[L55, ULTIMATE.startFINAL, L39-1]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[] 685788#[ULTIMATE.startFINAL, L39-1, 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[] 685790#[ULTIMATE.startFINAL, L39-1, L59]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] 687810#[ULTIMATE.startFINAL, L53, L39-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] 655716#[L40, 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] 655522#[L40, 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] 655188#[L40, L67, 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[] 653822#[L67, L43, ULTIMATE.startFINAL]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] 654454#[L43, ULTIMATE.startFINAL, L68-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[] 684488#[ULTIMATE.startFINAL, L44, L68-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] 684482#[ULTIMATE.startFINAL, L38, L68-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] 682770#[ULTIMATE.startFINAL, L68-1, L39]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] 684310#[ULTIMATE.startFINAL, L67, L68-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] 656312#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:26:56,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:56,164 INFO L85 PathProgramCache]: Analyzing trace with hash -446547798, now seen corresponding path program 19 times [2024-02-09 23:26:56,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:56,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138259164] [2024-02-09 23:26:56,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:56,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:56,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:56,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:56,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:56,175 INFO L85 PathProgramCache]: Analyzing trace with hash -353548279, now seen corresponding path program 8 times [2024-02-09 23:26:56,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:56,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733019249] [2024-02-09 23:26:56,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:56,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:56,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:56,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:56,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:56,183 INFO L85 PathProgramCache]: Analyzing trace with hash 889392818, now seen corresponding path program 8 times [2024-02-09 23:26:56,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:26:56,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793410087] [2024-02-09 23:26:56,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:26:56,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:26:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:56,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:26:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:26:56,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:26:56,883 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:26:56,883 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:26:56,883 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:26:56,883 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:26:56,883 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:26:56,883 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:56,883 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:26:56,884 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:26:56,884 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration30_Lasso [2024-02-09 23:26:56,884 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:26:56,884 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:26:56,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:56,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:56,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:57,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:57,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:57,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:26:57,816 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-02-09 23:26:57,818 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2024-02-09 23:26:58,415 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:26:58,415 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:26:58,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:58,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:58,420 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:58,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:58,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:58,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:58,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:58,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:58,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:58,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:58,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2024-02-09 23:26:58,444 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:58,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:58,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:58,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:58,449 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:58,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2024-02-09 23:26:58,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:58,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:58,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:58,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:58,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:58,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:58,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:58,461 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:58,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2024-02-09 23:26:58,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:58,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:58,465 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:58,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2024-02-09 23:26:58,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:58,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:58,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:58,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:58,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:58,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:26:58,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:26:58,476 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:58,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:58,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:58,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:58,480 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:58,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2024-02-09 23:26:58,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:58,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:58,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:26:58,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:26:58,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:26:58,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:58,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:26:58,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:26:58,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:26:58,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2024-02-09 23:26:58,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:58,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:58,491 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:58,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2024-02-09 23:26:58,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:26:58,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:26:58,498 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:26:58,498 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2024-02-09 23:26:58,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:26:58,540 INFO L401 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2024-02-09 23:26:58,540 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2024-02-09 23:26:58,638 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:26:58,846 INFO L443 ModelExtractionUtils]: Simplification made 35 calls to the SMT solver. [2024-02-09 23:26:58,846 INFO L444 ModelExtractionUtils]: 49 out of 78 variables were initially zero. Simplification set additionally 23 variables to zero. [2024-02-09 23:26:58,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:26:58,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:26:58,847 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:26:58,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2024-02-09 23:26:58,849 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:26:58,857 INFO L438 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2024-02-09 23:26:58,857 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:26:58,857 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerWithAssertThread1of1ForFork0_steal_num#1) = 2*N - 1*cnt + 2*workerWithAssertThread1of1ForFork0_steal_num#1 Supporting invariants [2*N - 1*cnt >= 0] [2024-02-09 23:26:58,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:58,865 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:26:58,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:58,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:26:58,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:59,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-09 23:26:59,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:26:59,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2024-02-09 23:26:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:26:59,515 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 7 loop predicates [2024-02-09 23:26:59,515 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18277 states and 48701 transitions. cyclomatic complexity: 31003 Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:59,816 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18277 states and 48701 transitions. cyclomatic complexity: 31003. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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 20875 states and 54613 transitions. Complement of second has 20 states. [2024-02-09 23:26:59,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 5 stem states 6 non-accepting loop states 2 accepting loop states [2024-02-09 23:26:59,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:26:59,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 79 transitions. [2024-02-09 23:26:59,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 79 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:26:59,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:26:59,818 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:26:59,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:26:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:26:59,844 WARN L260 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2024-02-09 23:26:59,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:00,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-09 23:27:00,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:00,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:00,499 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 7 loop predicates [2024-02-09 23:27:00,499 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18277 states and 48701 transitions. cyclomatic complexity: 31003 Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:00,751 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18277 states and 48701 transitions. cyclomatic complexity: 31003. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 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 20875 states and 54613 transitions. Complement of second has 20 states. [2024-02-09 23:27:00,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 5 stem states 6 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 79 transitions. [2024-02-09 23:27:00,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 79 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:27:00,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:00,752 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:27:00,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:00,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:27:00,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:01,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-09 23:27:01,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:01,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:01,307 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 7 loop predicates [2024-02-09 23:27:01,307 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18277 states and 48701 transitions. cyclomatic complexity: 31003 Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:02,363 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18277 states and 48701 transitions. cyclomatic complexity: 31003. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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 25717 states and 67066 transitions. Complement of second has 53 states. [2024-02-09 23:27:02,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 30 states 12 stem states 16 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 280 transitions. [2024-02-09 23:27:02,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 280 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:27:02,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:02,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 280 transitions. Stem has 34 letters. Loop has 16 letters. [2024-02-09 23:27:02,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:02,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 280 transitions. Stem has 18 letters. Loop has 32 letters. [2024-02-09 23:27:02,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:02,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25717 states and 67066 transitions. [2024-02-09 23:27:02,571 INFO L131 ngComponentsAnalysis]: Automaton has 130 accepting balls. 2750 [2024-02-09 23:27:02,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25717 states to 22652 states and 59606 transitions. [2024-02-09 23:27:02,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6910 [2024-02-09 23:27:02,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7282 [2024-02-09 23:27:02,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22652 states and 59606 transitions. [2024-02-09 23:27:02,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:27:02,645 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22652 states and 59606 transitions. [2024-02-09 23:27:02,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22652 states and 59606 transitions. [2024-02-09 23:27:02,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22652 to 18278. [2024-02-09 23:27:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18278 states, 18278 states have (on average 2.6651712441186124) internal successors, (48714), 18277 states have internal predecessors, (48714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18278 states to 18278 states and 48714 transitions. [2024-02-09 23:27:02,891 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18278 states and 48714 transitions. [2024-02-09 23:27:02,891 INFO L428 stractBuchiCegarLoop]: Abstraction has 18278 states and 48714 transitions. [2024-02-09 23:27:02,891 INFO L335 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2024-02-09 23:27:02,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18278 states and 48714 transitions. [2024-02-09 23:27:02,935 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 2044 [2024-02-09 23:27:02,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:27:02,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:27:02,936 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:27:02,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:27:02,936 INFO L748 eck$LassoCheckResult]: Stem: 757682#[$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[] 757618#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 757620#[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] 758320#[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] 758062#[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] 758064#[L67, 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] 758212#[ULTIMATE.startFINAL, L53, L67]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] 759624#[ULTIMATE.startFINAL, L67, 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] 759652#[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] 759676#[ULTIMATE.startFINAL, L67, L68-1]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] 759780#[ULTIMATE.startFINAL, L67, L54-1]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] 761456#[L55, ULTIMATE.startFINAL, L67]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] 763580#[L68-1, 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[] 761444#[L68-1, 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[] 761448#[L68-1, ULTIMATE.startFINAL, L59]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] 761264#[L68-1, 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] 761218#[L68-1, 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] 761048#[L68-1, L67, ULTIMATE.startFINAL]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] 761050#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:27:02,936 INFO L750 eck$LassoCheckResult]: Loop: 761050#[L68-1, ULTIMATE.startFINAL, L68-1]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] 761856#[L68-1, ULTIMATE.startFINAL, L54-1]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] 761850#[L68-1, 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[] 761852#[L68-1, 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[] 780016#[L68-1, ULTIMATE.startFINAL, L59]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] 780018#[L68-1, 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] 780024#[L68-1, 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] 791422#[L68-1, L67, ULTIMATE.startFINAL]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] 761050#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:27:02,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:02,937 INFO L85 PathProgramCache]: Analyzing trace with hash 619032292, now seen corresponding path program 3 times [2024-02-09 23:27:02,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:02,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857038949] [2024-02-09 23:27:02,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:02,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:02,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:02,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:02,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:02,952 INFO L85 PathProgramCache]: Analyzing trace with hash -909521573, now seen corresponding path program 9 times [2024-02-09 23:27:02,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:02,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422746952] [2024-02-09 23:27:02,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:02,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:02,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:02,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:02,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:02,958 INFO L85 PathProgramCache]: Analyzing trace with hash 902818110, now seen corresponding path program 4 times [2024-02-09 23:27:02,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:02,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76275224] [2024-02-09 23:27:02,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:02,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:02,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:02,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:03,448 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:27:03,448 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:27:03,448 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:27:03,448 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:27:03,448 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:27:03,448 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:03,448 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:27:03,448 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:27:03,448 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration31_Lasso [2024-02-09 23:27:03,448 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:27:03,448 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:27:03,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:03,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:03,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:03,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:03,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:03,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:03,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:03,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:03,937 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2024-02-09 23:27:04,270 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:27:04,270 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:27:04,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:04,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:04,271 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:04,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2024-02-09 23:27:04,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:04,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:04,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:27:04,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:04,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:04,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:04,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:27:04,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:27:04,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:04,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:04,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:04,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:04,282 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:04,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2024-02-09 23:27:04,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:04,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:04,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:04,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:04,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:04,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:04,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:04,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:04,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:04,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:04,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:04,296 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:04,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2024-02-09 23:27:04,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:04,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:04,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:04,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:04,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:04,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:04,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:04,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:04,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:04,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:04,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:04,308 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:04,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2024-02-09 23:27:04,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:04,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:04,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:04,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:04,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:04,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:04,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:04,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:04,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2024-02-09 23:27:04,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:04,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:04,329 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:04,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2024-02-09 23:27:04,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:04,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:04,337 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:27:04,337 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:27:04,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:04,355 INFO L401 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2024-02-09 23:27:04,355 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:27:04,389 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:27:04,426 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-02-09 23:27:04,426 INFO L444 ModelExtractionUtils]: 28 out of 46 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-02-09 23:27:04,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:04,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:04,427 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:04,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2024-02-09 23:27:04,428 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:27:04,435 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:27:04,435 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:27:04,435 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerThread1of1ForFork1_steal_num#1) = 3*N - 2*cnt + 2*workerThread1of1ForFork1_steal_num#1 Supporting invariants [3*N - 2*cnt >= 0] [2024-02-09 23:27:04,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2024-02-09 23:27:04,441 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:27:04,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:04,464 WARN L260 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2024-02-09 23:27:04,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:04,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:27:04,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:04,822 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 4 loop predicates [2024-02-09 23:27:04,822 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18278 states and 48714 transitions. cyclomatic complexity: 31015 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:05,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2024-02-09 23:27:05,128 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18278 states and 48714 transitions. cyclomatic complexity: 31015. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19658 states and 52439 transitions. Complement of second has 18 states. [2024-02-09 23:27:05,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 5 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2024-02-09 23:27:05,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 61 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:27:05,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:05,129 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:27:05,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:05,151 WARN L260 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2024-02-09 23:27:05,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:05,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:27:05,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:05,507 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 4 loop predicates [2024-02-09 23:27:05,507 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18278 states and 48714 transitions. cyclomatic complexity: 31015 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:05,727 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18278 states and 48714 transitions. cyclomatic complexity: 31015. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19658 states and 52439 transitions. Complement of second has 18 states. [2024-02-09 23:27:05,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 5 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:05,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:05,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2024-02-09 23:27:05,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 61 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:27:05,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:05,728 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:27:05,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:05,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:27:05,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:06,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:27:06,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:06,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:06,145 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 4 loop predicates [2024-02-09 23:27:06,145 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18278 states and 48714 transitions. cyclomatic complexity: 31015 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:06,650 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18278 states and 48714 transitions. cyclomatic complexity: 31015. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23391 states and 61901 transitions. Complement of second has 33 states. [2024-02-09 23:27:06,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 12 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:06,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:06,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 191 transitions. [2024-02-09 23:27:06,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 191 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:27:06,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:06,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 191 transitions. Stem has 26 letters. Loop has 8 letters. [2024-02-09 23:27:06,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:06,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 191 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:27:06,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:06,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23391 states and 61901 transitions. [2024-02-09 23:27:06,739 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 2162 [2024-02-09 23:27:06,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23391 states to 22650 states and 59766 transitions. [2024-02-09 23:27:06,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6446 [2024-02-09 23:27:06,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7157 [2024-02-09 23:27:06,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22650 states and 59766 transitions. [2024-02-09 23:27:06,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:27:06,815 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22650 states and 59766 transitions. [2024-02-09 23:27:06,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22650 states and 59766 transitions. [2024-02-09 23:27:07,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22650 to 19727. [2024-02-09 23:27:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19727 states, 19727 states have (on average 2.6737973336036904) internal successors, (52746), 19726 states have internal predecessors, (52746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:07,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19727 states to 19727 states and 52746 transitions. [2024-02-09 23:27:07,069 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19727 states and 52746 transitions. [2024-02-09 23:27:07,069 INFO L428 stractBuchiCegarLoop]: Abstraction has 19727 states and 52746 transitions. [2024-02-09 23:27:07,069 INFO L335 stractBuchiCegarLoop]: ======== Iteration 32 ============ [2024-02-09 23:27:07,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19727 states and 52746 transitions. [2024-02-09 23:27:07,117 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 2046 [2024-02-09 23:27:07,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:27:07,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:27:07,118 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:27:07,118 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:27:07,118 INFO L748 eck$LassoCheckResult]: Stem: 857348#[$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[] 857290#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 857292#[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] 857920#[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] 858228#[ULTIMATE.startFINAL, L53, L38]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] 859282#[ULTIMATE.startFINAL, L38, L54]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] 861058#[ULTIMATE.startFINAL, L39, L54]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] 861056#[ULTIMATE.startFINAL, L67, 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] 861048#[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] 860532#[ULTIMATE.startFINAL, L67, L68-1]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] 860508#[ULTIMATE.startFINAL, L67, L54-1]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] 860482#[L55, ULTIMATE.startFINAL, L67]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[] 860456#[ULTIMATE.startFINAL, L67, L58]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] 860458#[L68-1, 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[] 860496#[L68-1, ULTIMATE.startFINAL, L59]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] 860498#[L68-1, 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] 860396#[L68-1, 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] 860370#[L68-1, L67, ULTIMATE.startFINAL]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] 860364#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:27:07,118 INFO L750 eck$LassoCheckResult]: Loop: 860364#[L68-1, ULTIMATE.startFINAL, L68-1]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] 860362#[L68-1, ULTIMATE.startFINAL, L54-1]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] 860358#[L68-1, 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[] 860348#[L68-1, 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[] 860332#[L68-1, ULTIMATE.startFINAL, L59]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] 860312#[L68-1, 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] 860290#[L68-1, 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] 860292#[L68-1, L67, ULTIMATE.startFINAL]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] 860364#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:27:07,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:07,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1688195964, now seen corresponding path program 5 times [2024-02-09 23:27:07,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:07,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178913400] [2024-02-09 23:27:07,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:07,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:07,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:07,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:07,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:07,126 INFO L85 PathProgramCache]: Analyzing trace with hash -909521573, now seen corresponding path program 10 times [2024-02-09 23:27:07,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:07,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025028799] [2024-02-09 23:27:07,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:07,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:07,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:07,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:07,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:07,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1488795938, now seen corresponding path program 6 times [2024-02-09 23:27:07,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:07,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186733629] [2024-02-09 23:27:07,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:07,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:07,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:07,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:07,570 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:27:07,571 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:27:07,571 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:27:07,571 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:27:07,571 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:27:07,571 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:07,571 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:27:07,571 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:27:07,571 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration32_Lasso [2024-02-09 23:27:07,571 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:27:07,571 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:27:07,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:07,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:07,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:07,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:07,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:07,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:07,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:07,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:08,065 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2024-02-09 23:27:08,366 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:27:08,366 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:27:08,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:08,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:08,367 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:08,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2024-02-09 23:27:08,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:08,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:08,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:08,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:08,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:08,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:08,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:08,378 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:08,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:08,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:08,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:08,381 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:08,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2024-02-09 23:27:08,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:08,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:08,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:08,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:08,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:08,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:08,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:08,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:08,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2024-02-09 23:27:08,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:08,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:08,394 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:08,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2024-02-09 23:27:08,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:08,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:08,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:08,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:08,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:08,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:08,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:08,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:08,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:08,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:08,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:08,408 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:08,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2024-02-09 23:27:08,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:08,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:08,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:27:08,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:08,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:08,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:08,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:27:08,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:27:08,436 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:08,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:08,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:08,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:08,441 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:08,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:08,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2024-02-09 23:27:08,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:08,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:08,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:08,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:08,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:08,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:08,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:08,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2024-02-09 23:27:08,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:08,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:08,460 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:08,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2024-02-09 23:27:08,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:08,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:08,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:08,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:08,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:08,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:08,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:08,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:08,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2024-02-09 23:27:08,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:08,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:08,474 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:08,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2024-02-09 23:27:08,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:08,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:08,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:27:08,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:08,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:08,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:08,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:27:08,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:27:08,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:08,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:08,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:08,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:08,485 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:08,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2024-02-09 23:27:08,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:08,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:08,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:08,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:08,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:08,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:08,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:08,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:08,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:08,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:08,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:08,499 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:08,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:08,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:08,512 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:27:08,512 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:27:08,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:08,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2024-02-09 23:27:08,531 INFO L401 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2024-02-09 23:27:08,531 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:27:08,564 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:27:08,599 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2024-02-09 23:27:08,599 INFO L444 ModelExtractionUtils]: 31 out of 46 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-02-09 23:27:08,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:08,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:08,600 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:08,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2024-02-09 23:27:08,601 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:27:08,608 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:27:08,608 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:27:08,608 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerThread1of1ForFork1_steal_num#1) = 3*N - 2*cnt + 2*workerThread1of1ForFork1_steal_num#1 Supporting invariants [-2*cnt + 3*N >= 0] [2024-02-09 23:27:08,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2024-02-09 23:27:08,614 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:27:08,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:08,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:27:08,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:08,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:27:08,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:08,971 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 4 loop predicates [2024-02-09 23:27:08,971 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19727 states and 52746 transitions. cyclomatic complexity: 33674 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:09,202 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19727 states and 52746 transitions. cyclomatic complexity: 33674. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21148 states and 56538 transitions. Complement of second has 18 states. [2024-02-09 23:27:09,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 5 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:09,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2024-02-09 23:27:09,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 60 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:27:09,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:09,203 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:27:09,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:09,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:09,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:27:09,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:09,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:27:09,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:09,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:09,609 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 4 loop predicates [2024-02-09 23:27:09,610 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19727 states and 52746 transitions. cyclomatic complexity: 33674 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:09,829 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19727 states and 52746 transitions. cyclomatic complexity: 33674. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21148 states and 56538 transitions. Complement of second has 18 states. [2024-02-09 23:27:09,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 5 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:09,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2024-02-09 23:27:09,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 60 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:27:09,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:09,830 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:27:09,844 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:09,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:27:09,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:10,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:27:10,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:10,170 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 4 loop predicates [2024-02-09 23:27:10,170 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19727 states and 52746 transitions. cyclomatic complexity: 33674 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:10,693 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19727 states and 52746 transitions. cyclomatic complexity: 33674. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24732 states and 65477 transitions. Complement of second has 34 states. [2024-02-09 23:27:10,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 13 stem states 5 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:10,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 186 transitions. [2024-02-09 23:27:10,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 186 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:27:10,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:10,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 186 transitions. Stem has 26 letters. Loop has 8 letters. [2024-02-09 23:27:10,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:10,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 186 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:27:10,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:10,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24732 states and 65477 transitions. [2024-02-09 23:27:10,791 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 2162 [2024-02-09 23:27:10,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24732 states to 23943 states and 63262 transitions. [2024-02-09 23:27:10,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6822 [2024-02-09 23:27:10,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7550 [2024-02-09 23:27:10,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23943 states and 63262 transitions. [2024-02-09 23:27:10,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:27:10,874 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23943 states and 63262 transitions. [2024-02-09 23:27:10,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23943 states and 63262 transitions. [2024-02-09 23:27:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23943 to 19758. [2024-02-09 23:27:11,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19758 states, 19758 states have (on average 2.6737017916793198) internal successors, (52827), 19757 states have internal predecessors, (52827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19758 states to 19758 states and 52827 transitions. [2024-02-09 23:27:11,145 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19758 states and 52827 transitions. [2024-02-09 23:27:11,145 INFO L428 stractBuchiCegarLoop]: Abstraction has 19758 states and 52827 transitions. [2024-02-09 23:27:11,145 INFO L335 stractBuchiCegarLoop]: ======== Iteration 33 ============ [2024-02-09 23:27:11,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19758 states and 52827 transitions. [2024-02-09 23:27:11,194 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 2046 [2024-02-09 23:27:11,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:27:11,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:27:11,195 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:27:11,195 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:27:11,196 INFO L748 eck$LassoCheckResult]: Stem: 964248#[$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[] 964198#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 964200#[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] 964822#[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] 965124#[ULTIMATE.startFINAL, L53, L38]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] 966082#[ULTIMATE.startFINAL, L38, L54]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] 966084#[ULTIMATE.startFINAL, L39, L54]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] 966100#[ULTIMATE.startFINAL, L67, L54]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] 966130#[L68-1, ULTIMATE.startFINAL, L54]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] 966134#[ULTIMATE.startFINAL, L39-1, L54]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] 966164#[L40, ULTIMATE.startFINAL, L54]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[] 966166#[L43, ULTIMATE.startFINAL, L54]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[] 985618#[ULTIMATE.startFINAL, L44, L54]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] 998128#[ULTIMATE.startFINAL, L38, L54]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] 998124#[ULTIMATE.startFINAL, L39, 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] 998114#[L67, ULTIMATE.startFINAL, L39]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] 998116#[ULTIMATE.startFINAL, L68-1, L39]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] 964676#[ULTIMATE.startFINAL, L67, L68-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] 997734#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:27:11,196 INFO L750 eck$LassoCheckResult]: Loop: 997734#[L68-1, ULTIMATE.startFINAL, L68-1]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] 997696#[L68-1, ULTIMATE.startFINAL, L54-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] 997668#[ULTIMATE.startFINAL, L39-1, L54-1]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] 997656#[L55, ULTIMATE.startFINAL, L39-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] 997514#[L40, 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[] 966718#[L40, 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[] 966694#[L40, ULTIMATE.startFINAL, L59]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] 996448#[L40, 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] 996446#[L40, ULTIMATE.startFINAL, L54]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[] 996436#[L43, 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] 996432#[L67, L43, ULTIMATE.startFINAL]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] 986182#[L43, ULTIMATE.startFINAL, L68-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[] 994182#[ULTIMATE.startFINAL, L44, L68-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] 996418#[ULTIMATE.startFINAL, L38, L68-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] 995978#[ULTIMATE.startFINAL, L68-1, L39]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] 997788#[ULTIMATE.startFINAL, L67, L68-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] 997734#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:27:11,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:11,196 INFO L85 PathProgramCache]: Analyzing trace with hash -682301526, now seen corresponding path program 20 times [2024-02-09 23:27:11,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:11,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409944493] [2024-02-09 23:27:11,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:11,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:11,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:11,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:11,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:11,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1440873751, now seen corresponding path program 9 times [2024-02-09 23:27:11,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:11,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132333375] [2024-02-09 23:27:11,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:11,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:11,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:11,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:11,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:11,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1934855488, now seen corresponding path program 9 times [2024-02-09 23:27:11,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:11,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033279558] [2024-02-09 23:27:11,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:11,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:11,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:11,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:11,808 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:27:11,808 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:27:11,809 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:27:11,809 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:27:11,809 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:27:11,809 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:11,809 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:27:11,809 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:27:11,809 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration33_Lasso [2024-02-09 23:27:11,809 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:27:11,809 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:27:11,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:11,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:12,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:12,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:12,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:12,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:13,284 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-02-09 23:27:13,285 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2024-02-09 23:27:14,059 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:27:14,059 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:27:14,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:14,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:14,060 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:14,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2024-02-09 23:27:14,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:14,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:14,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:14,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:14,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:14,068 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:14,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:14,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:14,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:14,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:14,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:14,074 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:14,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2024-02-09 23:27:14,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:14,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:14,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:14,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:14,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:14,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:14,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:14,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:14,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:14,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:14,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:14,088 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:14,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2024-02-09 23:27:14,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:14,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:14,095 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:27:14,095 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2024-02-09 23:27:14,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:14,148 INFO L401 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2024-02-09 23:27:14,148 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2024-02-09 23:27:14,290 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:27:14,471 INFO L443 ModelExtractionUtils]: Simplification made 34 calls to the SMT solver. [2024-02-09 23:27:14,471 INFO L444 ModelExtractionUtils]: 54 out of 78 variables were initially zero. Simplification set additionally 18 variables to zero. [2024-02-09 23:27:14,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:14,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:14,476 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:14,480 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:27:14,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2024-02-09 23:27:14,510 INFO L438 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2024-02-09 23:27:14,511 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:27:14,511 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerWithAssertThread1of1ForFork0_steal_num#1, cnt) = 2*N + 2*workerWithAssertThread1of1ForFork0_steal_num#1 - 1*cnt Supporting invariants [-1*cnt + 2*N >= 0] [2024-02-09 23:27:14,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:14,521 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:27:14,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:14,551 WARN L260 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2024-02-09 23:27:14,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:14,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-09 23:27:14,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:15,107 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 7 loop predicates [2024-02-09 23:27:15,107 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19758 states and 52827 transitions. cyclomatic complexity: 33724 Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:15,371 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19758 states and 52827 transitions. cyclomatic complexity: 33724. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 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 22436 states and 58927 transitions. Complement of second has 20 states. [2024-02-09 23:27:15,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 5 stem states 6 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2024-02-09 23:27:15,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 78 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:27:15,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:15,372 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:27:15,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:15,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:27:15,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:15,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-09 23:27:15,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:15,870 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 7 loop predicates [2024-02-09 23:27:15,870 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19758 states and 52827 transitions. cyclomatic complexity: 33724 Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:16,109 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19758 states and 52827 transitions. cyclomatic complexity: 33724. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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 22436 states and 58927 transitions. Complement of second has 20 states. [2024-02-09 23:27:16,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 5 stem states 6 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2024-02-09 23:27:16,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 78 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:27:16,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:16,110 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:27:16,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:16,132 WARN L260 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2024-02-09 23:27:16,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:16,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-09 23:27:16,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:16,709 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 7 loop predicates [2024-02-09 23:27:16,709 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19758 states and 52827 transitions. cyclomatic complexity: 33724 Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:17,792 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19758 states and 52827 transitions. cyclomatic complexity: 33724. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 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 26757 states and 69469 transitions. Complement of second has 63 states. [2024-02-09 23:27:17,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 29 states 11 stem states 16 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:17,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 236 transitions. [2024-02-09 23:27:17,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 236 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:27:17,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:17,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 236 transitions. Stem has 34 letters. Loop has 16 letters. [2024-02-09 23:27:17,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:17,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 236 transitions. Stem has 18 letters. Loop has 32 letters. [2024-02-09 23:27:17,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:17,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26757 states and 69469 transitions. [2024-02-09 23:27:17,894 INFO L131 ngComponentsAnalysis]: Automaton has 116 accepting balls. 2640 [2024-02-09 23:27:17,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26757 states to 23366 states and 61624 transitions. [2024-02-09 23:27:17,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7078 [2024-02-09 23:27:17,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7508 [2024-02-09 23:27:17,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23366 states and 61624 transitions. [2024-02-09 23:27:17,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:27:17,974 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23366 states and 61624 transitions. [2024-02-09 23:27:18,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23366 states and 61624 transitions. [2024-02-09 23:27:18,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:18,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23366 to 19785. [2024-02-09 23:27:18,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19785 states, 19785 states have (on average 2.6746525145312106) internal successors, (52918), 19784 states have internal predecessors, (52918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19785 states to 19785 states and 52918 transitions. [2024-02-09 23:27:18,420 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19785 states and 52918 transitions. [2024-02-09 23:27:18,420 INFO L428 stractBuchiCegarLoop]: Abstraction has 19785 states and 52918 transitions. [2024-02-09 23:27:18,420 INFO L335 stractBuchiCegarLoop]: ======== Iteration 34 ============ [2024-02-09 23:27:18,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19785 states and 52918 transitions. [2024-02-09 23:27:18,469 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 2046 [2024-02-09 23:27:18,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:27:18,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:27:18,470 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:27:18,470 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:27:18,470 INFO L748 eck$LassoCheckResult]: Stem: 1075960#[$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[] 1075892#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 1075894#[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] 1076566#[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] 1076852#[ULTIMATE.startFINAL, L53, L38]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] 1077840#[ULTIMATE.startFINAL, L38, 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] 1078998#[L67, ULTIMATE.startFINAL, L38]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] 1079248#[ULTIMATE.startFINAL, L38, L68-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] 1079256#[ULTIMATE.startFINAL, L68-1, L39]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] 1079224#[ULTIMATE.startFINAL, L54-1, L39]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] 1079194#[ULTIMATE.startFINAL, L55, L39]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] 1079196#[L55, ULTIMATE.startFINAL, L67]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[] 1079162#[ULTIMATE.startFINAL, L67, L58]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] 1079164#[L68-1, 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[] 1098250#[L68-1, ULTIMATE.startFINAL, L59]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] 1098242#[L68-1, 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] 1079064#[L68-1, 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] 1079042#[L68-1, L67, ULTIMATE.startFINAL]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] 1079044#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:27:18,470 INFO L750 eck$LassoCheckResult]: Loop: 1079044#[L68-1, ULTIMATE.startFINAL, L68-1]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] 1079406#[L68-1, ULTIMATE.startFINAL, L54-1]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] 1079506#[L68-1, 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[] 1079508#[L68-1, 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[] 1098216#[L68-1, ULTIMATE.startFINAL, L59]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] 1098206#[L68-1, 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] 1098188#[L68-1, 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] 1098170#[L68-1, L67, ULTIMATE.startFINAL]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] 1079044#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-09 23:27:18,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:18,471 INFO L85 PathProgramCache]: Analyzing trace with hash -130359706, now seen corresponding path program 7 times [2024-02-09 23:27:18,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:18,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588147711] [2024-02-09 23:27:18,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:18,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:18,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:18,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:18,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:18,479 INFO L85 PathProgramCache]: Analyzing trace with hash -909521573, now seen corresponding path program 11 times [2024-02-09 23:27:18,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:18,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190675033] [2024-02-09 23:27:18,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:18,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:18,491 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:18,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:18,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:18,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1085901120, now seen corresponding path program 8 times [2024-02-09 23:27:18,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:18,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156127815] [2024-02-09 23:27:18,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:18,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:18,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:18,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:18,917 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:27:18,917 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:27:18,918 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:27:18,918 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:27:18,918 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:27:18,918 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:18,918 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:27:18,918 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:27:18,918 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration34_Lasso [2024-02-09 23:27:18,918 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:27:18,918 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:27:18,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:18,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:18,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:19,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:19,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:19,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:19,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:19,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:19,709 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2024-02-09 23:27:19,989 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:27:19,989 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:27:19,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:19,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:19,992 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:19,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2024-02-09 23:27:19,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:20,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:20,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:20,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:20,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:20,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:20,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:20,003 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:20,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2024-02-09 23:27:20,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:20,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:20,006 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:20,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2024-02-09 23:27:20,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:20,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:20,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:20,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:20,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:20,015 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:20,015 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:20,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:20,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2024-02-09 23:27:20,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:20,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:20,025 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:20,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2024-02-09 23:27:20,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:20,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:20,033 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:27:20,033 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:27:20,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:20,050 INFO L401 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2024-02-09 23:27:20,050 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:27:20,083 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:27:20,127 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2024-02-09 23:27:20,127 INFO L444 ModelExtractionUtils]: 28 out of 46 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-02-09 23:27:20,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:20,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:20,128 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:20,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2024-02-09 23:27:20,130 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:27:20,137 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-09 23:27:20,137 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:27:20,137 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerThread1of1ForFork1_steal_num#1) = 1*N - 1*cnt + 1*workerThread1of1ForFork1_steal_num#1 Supporting invariants [1*N - 1*cnt >= 0] [2024-02-09 23:27:20,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:20,143 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:27:20,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:20,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:27:20,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:20,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-09 23:27:20,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:20,316 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2024-02-09 23:27:20,317 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19785 states and 52918 transitions. cyclomatic complexity: 33788 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:20,512 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19785 states and 52918 transitions. cyclomatic complexity: 33788. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27070 states and 71857 transitions. Complement of second has 15 states. [2024-02-09 23:27:20,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 4 stem states 4 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:20,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:20,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2024-02-09 23:27:20,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 82 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:27:20,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:20,513 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:27:20,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:20,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:27:20,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:20,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-09 23:27:20,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:20,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:20,690 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2024-02-09 23:27:20,690 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19785 states and 52918 transitions. cyclomatic complexity: 33788 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:20,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:20,988 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19785 states and 52918 transitions. cyclomatic complexity: 33788. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27070 states and 71857 transitions. Complement of second has 15 states. [2024-02-09 23:27:20,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 4 stem states 4 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:20,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2024-02-09 23:27:20,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 82 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:27:20,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:20,989 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:27:21,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:21,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:27:21,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:21,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-09 23:27:21,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:21,207 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2024-02-09 23:27:21,207 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19785 states and 52918 transitions. cyclomatic complexity: 33788 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:21,468 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19785 states and 52918 transitions. cyclomatic complexity: 33788. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36836 states and 97664 transitions. Complement of second has 14 states. [2024-02-09 23:27:21,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 4 stem states 4 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:21,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-02-09 23:27:21,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 115 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-09 23:27:21,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:21,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 115 transitions. Stem has 26 letters. Loop has 8 letters. [2024-02-09 23:27:21,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:21,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 115 transitions. Stem has 18 letters. Loop has 16 letters. [2024-02-09 23:27:21,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:21,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36836 states and 97664 transitions. [2024-02-09 23:27:21,648 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 2348 [2024-02-09 23:27:21,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36836 states to 29343 states and 75904 transitions. [2024-02-09 23:27:21,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6542 [2024-02-09 23:27:21,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7529 [2024-02-09 23:27:21,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29343 states and 75904 transitions. [2024-02-09 23:27:21,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:27:21,765 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29343 states and 75904 transitions. [2024-02-09 23:27:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29343 states and 75904 transitions. [2024-02-09 23:27:21,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29343 to 18929. [2024-02-09 23:27:22,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18929 states, 18929 states have (on average 2.677056368535052) internal successors, (50674), 18928 states have internal predecessors, (50674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:22,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18929 states to 18929 states and 50674 transitions. [2024-02-09 23:27:22,045 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18929 states and 50674 transitions. [2024-02-09 23:27:22,045 INFO L428 stractBuchiCegarLoop]: Abstraction has 18929 states and 50674 transitions. [2024-02-09 23:27:22,045 INFO L335 stractBuchiCegarLoop]: ======== Iteration 35 ============ [2024-02-09 23:27:22,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18929 states and 50674 transitions. [2024-02-09 23:27:22,092 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 2054 [2024-02-09 23:27:22,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:27:22,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:27:22,093 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:27:22,093 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:27:22,093 INFO L748 eck$LassoCheckResult]: Stem: 1206804#[$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[] 1206748#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 1206750#[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] 1207372#[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] 1207620#[ULTIMATE.startFINAL, L53, L38]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] 1209414#[ULTIMATE.startFINAL, L38, L54]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] 1210070#[ULTIMATE.startFINAL, L39, L54]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] 1210056#[ULTIMATE.startFINAL, L67, L54]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] 1210058#[L68-1, 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] 1225290#[L68-1, L67, ULTIMATE.startFINAL]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] 1225292#[L68-1, ULTIMATE.startFINAL, L68-1]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] 1209996#[L68-1, ULTIMATE.startFINAL, L54-1]don't care [2024-02-09 23:27:22,093 INFO L750 eck$LassoCheckResult]: Loop: 1209996#[L68-1, ULTIMATE.startFINAL, L54-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] 1206652#[ULTIMATE.startFINAL, L39-1, L54-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] 1206656#[L40, ULTIMATE.startFINAL, L54-1]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] 1206942#[L40, 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[] 1209972#[L40, ULTIMATE.startFINAL, L58]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[] 1209974#[L43, 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[] 1209190#[L43, ULTIMATE.startFINAL, L59]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[] 1209174#[ULTIMATE.startFINAL, L44, L59]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] 1241612#[ULTIMATE.startFINAL, L53, L44]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] 1241614#[ULTIMATE.startFINAL, L53, L38]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] 1206618#[ULTIMATE.startFINAL, L38, 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] 1206592#[L67, 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] 1206998#[L67, ULTIMATE.startFINAL, L39]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] 1207116#[L67, ULTIMATE.startFINAL, L67]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] 1214698#[L68-1, L67, ULTIMATE.startFINAL]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] 1210002#[L68-1, ULTIMATE.startFINAL, L68-1]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] 1209996#[L68-1, ULTIMATE.startFINAL, L54-1]don't care [2024-02-09 23:27:22,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:22,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1214798207, now seen corresponding path program 2 times [2024-02-09 23:27:22,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:22,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665709406] [2024-02-09 23:27:22,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:22,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:22,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:22,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:22,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:22,099 INFO L85 PathProgramCache]: Analyzing trace with hash -321580717, now seen corresponding path program 10 times [2024-02-09 23:27:22,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:22,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307868104] [2024-02-09 23:27:22,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:22,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:22,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:22,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:22,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:22,107 INFO L85 PathProgramCache]: Analyzing trace with hash 290437075, now seen corresponding path program 10 times [2024-02-09 23:27:22,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:22,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947867021] [2024-02-09 23:27:22,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:22,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:22,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:22,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:22,595 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:27:22,595 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:27:22,595 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:27:22,595 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:27:22,596 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:27:22,596 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:22,596 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:27:22,596 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:27:22,596 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration35_Lasso [2024-02-09 23:27:22,596 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:27:22,596 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:27:22,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:22,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:23,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:23,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:23,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:23,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:23,673 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-02-09 23:27:23,675 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2024-02-09 23:27:24,551 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:27:24,551 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:27:24,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:24,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:24,552 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:24,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2024-02-09 23:27:24,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:24,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:24,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:24,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:24,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:24,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:24,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:24,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:24,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:24,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:24,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:24,567 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:24,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2024-02-09 23:27:24,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-09 23:27:24,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:24,574 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:27:24,574 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2024-02-09 23:27:24,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:24,640 INFO L401 nArgumentSynthesizer]: We have 64 Motzkin's Theorem applications. [2024-02-09 23:27:24,640 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2024-02-09 23:27:24,840 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:27:25,097 INFO L443 ModelExtractionUtils]: Simplification made 25 calls to the SMT solver. [2024-02-09 23:27:25,097 INFO L444 ModelExtractionUtils]: 62 out of 100 variables were initially zero. Simplification set additionally 32 variables to zero. [2024-02-09 23:27:25,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:25,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:25,098 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:25,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2024-02-09 23:27:25,100 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:27:25,126 INFO L438 nArgumentSynthesizer]: Removed 7 redundant supporting invariants from a total of 8. [2024-02-09 23:27:25,126 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:27:25,126 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(cnt, N, workerWithAssertThread1of1ForFork0_steal_num#1) = -2*cnt + 3*N + 2*workerWithAssertThread1of1ForFork0_steal_num#1 Supporting invariants [3*N - 2*cnt >= 0] [2024-02-09 23:27:25,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:25,136 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:27:25,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:25,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-09 23:27:25,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:25,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-09 23:27:25,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:25,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:25,681 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 7 loop predicates [2024-02-09 23:27:25,681 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18929 states and 50674 transitions. cyclomatic complexity: 32321 Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:26,073 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18929 states and 50674 transitions. cyclomatic complexity: 32321. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 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 28806 states and 75999 transitions. Complement of second has 24 states. [2024-02-09 23:27:26,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 7 stem states 7 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 138 transitions. [2024-02-09 23:27:26,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 138 transitions. Stem has 11 letters. Loop has 16 letters. [2024-02-09 23:27:26,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:26,074 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:27:26,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:26,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:27:26,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:26,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-09 23:27:26,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:26,563 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 8 loop predicates [2024-02-09 23:27:26,563 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18929 states and 50674 transitions. cyclomatic complexity: 32321 Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:27,619 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18929 states and 50674 transitions. cyclomatic complexity: 32321. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 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 72810 states and 185165 transitions. Complement of second has 45 states. [2024-02-09 23:27:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 26 states 6 stem states 18 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 190 transitions. [2024-02-09 23:27:27,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 190 transitions. Stem has 11 letters. Loop has 16 letters. [2024-02-09 23:27:27,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:27,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 190 transitions. Stem has 27 letters. Loop has 16 letters. [2024-02-09 23:27:27,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:27,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 190 transitions. Stem has 11 letters. Loop has 32 letters. [2024-02-09 23:27:27,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:27,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72810 states and 185165 transitions. [2024-02-09 23:27:27,935 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 3220 [2024-02-09 23:27:28,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72810 states to 58089 states and 149354 transitions. [2024-02-09 23:27:28,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10941 [2024-02-09 23:27:28,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11853 [2024-02-09 23:27:28,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58089 states and 149354 transitions. [2024-02-09 23:27:28,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:27:28,169 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58089 states and 149354 transitions. [2024-02-09 23:27:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58089 states and 149354 transitions. [2024-02-09 23:27:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58089 to 38607. [2024-02-09 23:27:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38607 states, 38607 states have (on average 2.6736602170590826) internal successors, (103222), 38606 states have internal predecessors, (103222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:29,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38607 states to 38607 states and 103222 transitions. [2024-02-09 23:27:29,549 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38607 states and 103222 transitions. [2024-02-09 23:27:29,549 INFO L428 stractBuchiCegarLoop]: Abstraction has 38607 states and 103222 transitions. [2024-02-09 23:27:29,549 INFO L335 stractBuchiCegarLoop]: ======== Iteration 36 ============ [2024-02-09 23:27:29,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38607 states and 103222 transitions. [2024-02-09 23:27:29,776 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 3082 [2024-02-09 23:27:29,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:27:29,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:27:29,777 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:27:29,777 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:27:29,778 INFO L748 eck$LassoCheckResult]: Stem: 1346630#[$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[] 1346570#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 1346572#[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] 1347256#[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] 1346984#[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] 1346986#[L67, 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] 1347146#[ULTIMATE.startFINAL, L53, L67]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] 1349490#[L68-1, ULTIMATE.startFINAL, L53]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] 1349492#[ULTIMATE.startFINAL, L53, L39-1]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] 1364808#[ULTIMATE.startFINAL, L39-1, 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] 1364812#[L67, ULTIMATE.startFINAL, L39-1]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] 1364782#[ULTIMATE.startFINAL, L39-1, L68-1]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] 1348538#[ULTIMATE.startFINAL, L39-1, L54-1]don't care [2024-02-09 23:27:29,778 INFO L750 eck$LassoCheckResult]: Loop: 1348538#[ULTIMATE.startFINAL, L39-1, L54-1]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] 1416170#[L55, ULTIMATE.startFINAL, L39-1]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[] 1348516#[ULTIMATE.startFINAL, L39-1, 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[] 1348496#[ULTIMATE.startFINAL, L39-1, L59]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] 1348500#[ULTIMATE.startFINAL, L53, L39-1]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] 1347066#[ULTIMATE.startFINAL, L39-1, L54]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] 1380150#[L40, ULTIMATE.startFINAL, L54]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[] 1378778#[L43, 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] 1347422#[L67, 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[] 1415956#[L67, ULTIMATE.startFINAL, L44]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] 1415946#[L67, 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] 1415918#[L67, ULTIMATE.startFINAL, L39]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] 1390586#[L67, ULTIMATE.startFINAL, L67]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] 1390420#[L68-1, L67, ULTIMATE.startFINAL]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] 1357544#[L68-1, ULTIMATE.startFINAL, L68-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] 1403444#[ULTIMATE.startFINAL, L39-1, L68-1]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] 1348538#[ULTIMATE.startFINAL, L39-1, L54-1]don't care [2024-02-09 23:27:29,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:29,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1044735814, now seen corresponding path program 1 times [2024-02-09 23:27:29,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:29,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210274145] [2024-02-09 23:27:29,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:29,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:29,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:29,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:29,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:29,809 INFO L85 PathProgramCache]: Analyzing trace with hash -201829473, now seen corresponding path program 11 times [2024-02-09 23:27:29,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:29,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181089918] [2024-02-09 23:27:29,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:29,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:29,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:29,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:29,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:29,817 INFO L85 PathProgramCache]: Analyzing trace with hash 675568216, now seen corresponding path program 11 times [2024-02-09 23:27:29,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:29,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930669118] [2024-02-09 23:27:29,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:29,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:29,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:29,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:30,334 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:27:30,334 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:27:30,334 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:27:30,334 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:27:30,334 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:27:30,335 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:30,335 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:27:30,335 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:27:30,335 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration36_Lasso [2024-02-09 23:27:30,335 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:27:30,335 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:27:30,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:30,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:30,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:30,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:30,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:30,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:31,102 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2024-02-09 23:27:31,103 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-02-09 23:27:31,745 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:27:31,745 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:27:31,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:31,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:31,748 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:31,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:31,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:31,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:31,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:31,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:31,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:31,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:31,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2024-02-09 23:27:31,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:31,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:31,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:31,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:31,788 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:31,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:31,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:31,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:31,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:31,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:31,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:31,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:31,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2024-02-09 23:27:31,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:31,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:31,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:31,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:31,818 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:31,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:31,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:31,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:31,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:31,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:31,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:31,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:31,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2024-02-09 23:27:31,840 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:31,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:31,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:31,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:31,844 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:31,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:31,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:31,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:31,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:31,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:31,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:31,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:31,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2024-02-09 23:27:31,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:31,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:31,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:31,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:31,867 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:31,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:31,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2024-02-09 23:27:31,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:31,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:27:31,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:31,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:31,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:31,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:27:31,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:27:31,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:31,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:31,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:31,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:31,896 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:31,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:31,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2024-02-09 23:27:31,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:31,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:27:31,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:31,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:31,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:31,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:27:31,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:27:31,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:31,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:31,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:31,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:31,919 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:31,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:31,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:31,928 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:27:31,928 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2024-02-09 23:27:31,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:31,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2024-02-09 23:27:31,983 INFO L401 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2024-02-09 23:27:31,983 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2024-02-09 23:27:32,170 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:27:32,323 INFO L443 ModelExtractionUtils]: Simplification made 29 calls to the SMT solver. [2024-02-09 23:27:32,323 INFO L444 ModelExtractionUtils]: 54 out of 78 variables were initially zero. Simplification set additionally 18 variables to zero. [2024-02-09 23:27:32,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:32,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:32,324 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:32,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2024-02-09 23:27:32,326 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:27:32,334 INFO L438 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2024-02-09 23:27:32,334 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:27:32,334 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerThread1of1ForFork1_sz#1, cnt) = 2*N + 2*workerThread1of1ForFork1_sz#1 - 1*cnt Supporting invariants [2*N - 1*cnt >= 0] [2024-02-09 23:27:32,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:32,342 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:27:32,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:32,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-09 23:27:32,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:32,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:32,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 12 conjunts are in the unsatisfiable core [2024-02-09 23:27:32,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:32,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:32,766 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 7 loop predicates [2024-02-09 23:27:32,766 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38607 states and 103222 transitions. cyclomatic complexity: 65569 Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:33,414 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38607 states and 103222 transitions. cyclomatic complexity: 65569. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 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 83245 states and 207996 transitions. Complement of second has 25 states. [2024-02-09 23:27:33,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 6 stem states 8 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:33,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 128 transitions. [2024-02-09 23:27:33,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 128 transitions. Stem has 12 letters. Loop has 16 letters. [2024-02-09 23:27:33,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:33,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 128 transitions. Stem has 28 letters. Loop has 16 letters. [2024-02-09 23:27:33,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:33,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 128 transitions. Stem has 12 letters. Loop has 32 letters. [2024-02-09 23:27:33,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:33,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83245 states and 207996 transitions. [2024-02-09 23:27:34,048 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 3082 [2024-02-09 23:27:34,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83245 states to 65717 states and 166406 transitions. [2024-02-09 23:27:34,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10857 [2024-02-09 23:27:34,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11595 [2024-02-09 23:27:34,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65717 states and 166406 transitions. [2024-02-09 23:27:34,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:27:34,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65717 states and 166406 transitions. [2024-02-09 23:27:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65717 states and 166406 transitions. [2024-02-09 23:27:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65717 to 45216. [2024-02-09 23:27:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45216 states, 45216 states have (on average 2.6398619957537157) internal successors, (119364), 45215 states have internal predecessors, (119364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45216 states to 45216 states and 119364 transitions. [2024-02-09 23:27:35,368 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45216 states and 119364 transitions. [2024-02-09 23:27:35,368 INFO L428 stractBuchiCegarLoop]: Abstraction has 45216 states and 119364 transitions. [2024-02-09 23:27:35,368 INFO L335 stractBuchiCegarLoop]: ======== Iteration 37 ============ [2024-02-09 23:27:35,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45216 states and 119364 transitions. [2024-02-09 23:27:35,520 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 3082 [2024-02-09 23:27:35,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:27:35,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:27:35,521 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:27:35,521 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:27:35,522 INFO L748 eck$LassoCheckResult]: Stem: 1507257#[$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[] 1507195#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 1507197#[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] 1507843#[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] 1508135#[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] 1508233#[L67, 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] 1508235#[ULTIMATE.startFINAL, L53, L67]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] 1509855#[L68-1, ULTIMATE.startFINAL, L53]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] 1509857#[ULTIMATE.startFINAL, L53, L39-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] 1520083#[L40, ULTIMATE.startFINAL, L53]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[] 1520077#[ULTIMATE.startFINAL, L43, 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] 1520071#[L43, ULTIMATE.startFINAL, L54]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[] 1520073#[ULTIMATE.startFINAL, L44, L54]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] 1549173#[ULTIMATE.startFINAL, L38, L54]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] 1549211#[ULTIMATE.startFINAL, L39, 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] 1549207#[L67, ULTIMATE.startFINAL, L39]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] 1549215#[ULTIMATE.startFINAL, L68-1, L39]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] 1549069#[ULTIMATE.startFINAL, L54-1, L39]don't care [2024-02-09 23:27:35,522 INFO L750 eck$LassoCheckResult]: Loop: 1549069#[ULTIMATE.startFINAL, L54-1, L39]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] 1548917#[ULTIMATE.startFINAL, L67, L54-1]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] 1547673#[L55, ULTIMATE.startFINAL, L67]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] 1570513#[L68-1, 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[] 1574749#[L68-1, ULTIMATE.startFINAL, L58]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] 1545601#[ULTIMATE.startFINAL, L39-1, L58]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] 1586505#[L40, ULTIMATE.startFINAL, L58]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[] 1516743#[L43, ULTIMATE.startFINAL, L58]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[] 1587223#[ULTIMATE.startFINAL, L44, 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[] 1589413#[ULTIMATE.startFINAL, L44, L59]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] 1589565#[ULTIMATE.startFINAL, L38, L59]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] 1589625#[ULTIMATE.startFINAL, L39, L59]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] 1589617#[ULTIMATE.startFINAL, L53, L39]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] 1587515#[ULTIMATE.startFINAL, L39, 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] 1587501#[L67, ULTIMATE.startFINAL, L39]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] 1590521#[ULTIMATE.startFINAL, L68-1, L39]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] 1549069#[ULTIMATE.startFINAL, L54-1, L39]don't care [2024-02-09 23:27:35,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:35,522 INFO L85 PathProgramCache]: Analyzing trace with hash 506358883, now seen corresponding path program 2 times [2024-02-09 23:27:35,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:35,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439534375] [2024-02-09 23:27:35,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:35,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:35,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:35,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:35,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:35,530 INFO L85 PathProgramCache]: Analyzing trace with hash 994070387, now seen corresponding path program 12 times [2024-02-09 23:27:35,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:35,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346581590] [2024-02-09 23:27:35,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:35,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:35,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:35,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:35,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:35,545 INFO L85 PathProgramCache]: Analyzing trace with hash -937576491, now seen corresponding path program 12 times [2024-02-09 23:27:35,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:35,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807052697] [2024-02-09 23:27:35,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:35,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:35,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:35,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:36,207 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:27:36,207 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:27:36,207 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:27:36,207 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:27:36,207 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:27:36,207 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:36,207 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:27:36,207 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:27:36,207 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration37_Lasso [2024-02-09 23:27:36,207 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:27:36,207 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:27:36,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:36,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:36,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:36,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:36,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:37,533 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:27:37,533 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:27:37,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:37,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:37,534 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:37,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2024-02-09 23:27:37,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:37,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:37,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:37,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:37,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:37,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:37,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:37,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:37,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:37,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:37,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:37,549 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:37,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2024-02-09 23:27:37,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:37,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:37,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:27:37,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:37,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:37,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:37,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:27:37,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:27:37,557 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:37,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2024-02-09 23:27:37,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:37,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:37,560 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:37,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2024-02-09 23:27:37,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:37,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:37,567 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-02-09 23:27:37,567 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:27:37,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:37,591 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2024-02-09 23:27:37,591 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:27:37,648 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:27:37,694 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2024-02-09 23:27:37,694 INFO L444 ModelExtractionUtils]: 47 out of 61 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-02-09 23:27:37,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:37,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:37,695 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:37,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2024-02-09 23:27:37,696 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:27:37,703 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2024-02-09 23:27:37,703 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:27:37,703 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2024-02-09 23:27:37,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:37,708 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:27:37,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:37,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:27:37,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:37,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-09 23:27:37,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:37,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:37,934 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2024-02-09 23:27:37,934 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45216 states and 119364 transitions. cyclomatic complexity: 75224 Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:38,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:38,317 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45216 states and 119364 transitions. cyclomatic complexity: 75224. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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 97688 states and 249786 transitions. Complement of second has 9 states. [2024-02-09 23:27:38,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-02-09 23:27:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:38,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2024-02-09 23:27:38,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 17 letters. Loop has 16 letters. [2024-02-09 23:27:38,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:38,318 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:27:38,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:38,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:27:38,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:38,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-09 23:27:38,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:38,677 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2024-02-09 23:27:38,677 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45216 states and 119364 transitions. cyclomatic complexity: 75224 Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:39,531 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45216 states and 119364 transitions. cyclomatic complexity: 75224. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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 125763 states and 318079 transitions. Complement of second has 19 states. [2024-02-09 23:27:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2024-02-09 23:27:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:39,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2024-02-09 23:27:39,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 100 transitions. Stem has 17 letters. Loop has 16 letters. [2024-02-09 23:27:39,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:39,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 100 transitions. Stem has 33 letters. Loop has 16 letters. [2024-02-09 23:27:39,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:39,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 100 transitions. Stem has 17 letters. Loop has 32 letters. [2024-02-09 23:27:39,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:39,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125763 states and 318079 transitions. [2024-02-09 23:27:40,631 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 3628 [2024-02-09 23:27:41,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125763 states to 98764 states and 252024 transitions. [2024-02-09 23:27:41,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13442 [2024-02-09 23:27:41,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14653 [2024-02-09 23:27:41,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98764 states and 252024 transitions. [2024-02-09 23:27:41,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:27:41,068 INFO L218 hiAutomatonCegarLoop]: Abstraction has 98764 states and 252024 transitions. [2024-02-09 23:27:41,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98764 states and 252024 transitions. [2024-02-09 23:27:42,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98764 to 68011. [2024-02-09 23:27:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68011 states, 68011 states have (on average 2.664921850877064) internal successors, (181244), 68010 states have internal predecessors, (181244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:42,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68011 states to 68011 states and 181244 transitions. [2024-02-09 23:27:42,672 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68011 states and 181244 transitions. [2024-02-09 23:27:42,672 INFO L428 stractBuchiCegarLoop]: Abstraction has 68011 states and 181244 transitions. [2024-02-09 23:27:42,673 INFO L335 stractBuchiCegarLoop]: ======== Iteration 38 ============ [2024-02-09 23:27:42,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68011 states and 181244 transitions. [2024-02-09 23:27:43,182 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 3614 [2024-02-09 23:27:43,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:27:43,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:27:43,184 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:27:43,184 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:27:43,184 INFO L748 eck$LassoCheckResult]: Stem: 1821415#[$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[] 1821345#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 1821347#[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] 1822021#[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] 1821769#[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] 1821771#[L67, 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] 1821923#[ULTIMATE.startFINAL, L53, L67]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] 1823921#[L68-1, 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] 1824511#[L68-1, 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] 1824501#[L68-1, L67, ULTIMATE.startFINAL]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] 1824503#[L68-1, ULTIMATE.startFINAL, L68-1]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] 1840457#[L68-1, ULTIMATE.startFINAL, L54-1]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] 1848787#[L68-1, 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[] 1848777#[L68-1, 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[] 1848779#[L68-1, ULTIMATE.startFINAL, L59]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] 1850451#[L68-1, 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] 1850453#[L68-1, 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] 1850843#[L68-1, L67, ULTIMATE.startFINAL]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] 1850845#[L68-1, ULTIMATE.startFINAL, L68-1]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] 1846919#[L68-1, ULTIMATE.startFINAL, L54-1]don't care [2024-02-09 23:27:43,185 INFO L750 eck$LassoCheckResult]: Loop: 1846919#[L68-1, ULTIMATE.startFINAL, L54-1]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] 1873355#[L68-1, ULTIMATE.startFINAL, L55]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] 1873357#[L55, ULTIMATE.startFINAL, L39-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] 1873331#[L40, 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[] 1873303#[L40, 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[] 1873279#[L40, ULTIMATE.startFINAL, L59]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[] 1873281#[L43, ULTIMATE.startFINAL, L59]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] 1873243#[ULTIMATE.startFINAL, L43, 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] 1873171#[L43, ULTIMATE.startFINAL, L54]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[] 1836661#[ULTIMATE.startFINAL, L44, 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] 1873161#[L67, ULTIMATE.startFINAL, L44]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] 1873151#[L67, 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] 1873141#[L67, ULTIMATE.startFINAL, L39]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] 1873123#[L67, ULTIMATE.startFINAL, L67]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] 1873879#[L68-1, L67, ULTIMATE.startFINAL]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] 1873525#[L68-1, ULTIMATE.startFINAL, L68-1]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] 1846919#[L68-1, ULTIMATE.startFINAL, L54-1]don't care [2024-02-09 23:27:43,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:43,185 INFO L85 PathProgramCache]: Analyzing trace with hash -263332393, now seen corresponding path program 9 times [2024-02-09 23:27:43,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:43,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817007464] [2024-02-09 23:27:43,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:43,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:43,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:43,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:43,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:43,203 INFO L85 PathProgramCache]: Analyzing trace with hash -352943833, now seen corresponding path program 13 times [2024-02-09 23:27:43,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:43,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823643792] [2024-02-09 23:27:43,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:43,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:43,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:43,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:43,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:43,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1276513539, now seen corresponding path program 13 times [2024-02-09 23:27:43,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:43,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293683888] [2024-02-09 23:27:43,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:43,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:43,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:43,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:43,801 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:27:43,801 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:27:43,801 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:27:43,801 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:27:43,801 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:27:43,801 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:43,801 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:27:43,801 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:27:43,801 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration38_Lasso [2024-02-09 23:27:43,801 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:27:43,801 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:27:43,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:43,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:43,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:43,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:43,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:43,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:44,704 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-02-09 23:27:45,460 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:27:45,460 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:27:45,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:45,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:45,464 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:45,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2024-02-09 23:27:45,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:45,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:45,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:45,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:45,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:45,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:45,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:45,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:45,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:45,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:45,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:45,504 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:45,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2024-02-09 23:27:45,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:45,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:45,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:45,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:45,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:45,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:45,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:45,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:45,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:45,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:45,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:45,518 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:45,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2024-02-09 23:27:45,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:45,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:45,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:45,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:45,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:45,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:45,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:45,529 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:45,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2024-02-09 23:27:45,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:45,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:45,533 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:45,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2024-02-09 23:27:45,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:45,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:45,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:45,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:45,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:45,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:45,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:45,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:45,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2024-02-09 23:27:45,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:45,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:45,546 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:45,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2024-02-09 23:27:45,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:45,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:45,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:45,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:45,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:45,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:45,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:45,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:45,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2024-02-09 23:27:45,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:45,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:45,558 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:45,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2024-02-09 23:27:45,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:45,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:45,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:27:45,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:45,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:45,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:45,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:27:45,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:27:45,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:45,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:45,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:45,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:45,569 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:45,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2024-02-09 23:27:45,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:45,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:45,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:27:45,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:45,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:45,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:45,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:27:45,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:27:45,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:45,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2024-02-09 23:27:45,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:45,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:45,579 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:45,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2024-02-09 23:27:45,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:45,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:45,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:27:45,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:45,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:45,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:45,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:27:45,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:27:45,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:45,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2024-02-09 23:27:45,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:45,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:45,590 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:45,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2024-02-09 23:27:45,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:45,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:45,597 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-09 23:27:45,597 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2024-02-09 23:27:45,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:45,654 INFO L401 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2024-02-09 23:27:45,654 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2024-02-09 23:27:45,835 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:27:46,023 INFO L443 ModelExtractionUtils]: Simplification made 30 calls to the SMT solver. [2024-02-09 23:27:46,023 INFO L444 ModelExtractionUtils]: 49 out of 78 variables were initially zero. Simplification set additionally 23 variables to zero. [2024-02-09 23:27:46,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:46,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:46,024 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:46,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2024-02-09 23:27:46,026 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:27:46,034 INFO L438 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2024-02-09 23:27:46,034 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:27:46,035 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerThread1of1ForFork1_sz#1) = 2*N - 1*cnt + 2*workerThread1of1ForFork1_sz#1 Supporting invariants [-1*cnt + 2*N >= 0] [2024-02-09 23:27:46,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:46,043 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:27:46,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:46,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 18 conjunts are in the unsatisfiable core [2024-02-09 23:27:46,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:46,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:46,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-09 23:27:46,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:46,842 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 7 loop predicates [2024-02-09 23:27:46,842 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68011 states and 181244 transitions. cyclomatic complexity: 114719 Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:47,617 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68011 states and 181244 transitions. cyclomatic complexity: 114719. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 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 85902 states and 224375 transitions. Complement of second has 26 states. [2024-02-09 23:27:47,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 7 stem states 8 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:47,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 139 transitions. [2024-02-09 23:27:47,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 139 transitions. Stem has 19 letters. Loop has 16 letters. [2024-02-09 23:27:47,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:47,618 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:27:47,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:47,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 18 conjunts are in the unsatisfiable core [2024-02-09 23:27:47,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:47,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-09 23:27:48,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:48,392 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 7 loop predicates [2024-02-09 23:27:48,393 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68011 states and 181244 transitions. cyclomatic complexity: 114719 Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:49,231 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68011 states and 181244 transitions. cyclomatic complexity: 114719. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 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 85902 states and 224375 transitions. Complement of second has 26 states. [2024-02-09 23:27:49,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 7 stem states 8 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 139 transitions. [2024-02-09 23:27:49,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 139 transitions. Stem has 19 letters. Loop has 16 letters. [2024-02-09 23:27:49,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:49,232 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:27:49,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:49,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 16 conjunts are in the unsatisfiable core [2024-02-09 23:27:49,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:49,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 12 conjunts are in the unsatisfiable core [2024-02-09 23:27:49,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:49,901 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 7 loop predicates [2024-02-09 23:27:49,901 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68011 states and 181244 transitions. cyclomatic complexity: 114719 Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:51,403 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68011 states and 181244 transitions. cyclomatic complexity: 114719. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 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 151603 states and 388427 transitions. Complement of second has 41 states. [2024-02-09 23:27:51,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 11 stem states 8 non-accepting loop states 2 accepting loop states [2024-02-09 23:27:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:51,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 197 transitions. [2024-02-09 23:27:51,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 197 transitions. Stem has 19 letters. Loop has 16 letters. [2024-02-09 23:27:51,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:51,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 197 transitions. Stem has 35 letters. Loop has 16 letters. [2024-02-09 23:27:51,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:51,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 197 transitions. Stem has 19 letters. Loop has 32 letters. [2024-02-09 23:27:51,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:51,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151603 states and 388427 transitions. [2024-02-09 23:27:52,532 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 10436 [2024-02-09 23:27:53,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151603 states to 121908 states and 314342 transitions. [2024-02-09 23:27:53,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18291 [2024-02-09 23:27:53,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20822 [2024-02-09 23:27:53,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121908 states and 314342 transitions. [2024-02-09 23:27:53,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:27:53,314 INFO L218 hiAutomatonCegarLoop]: Abstraction has 121908 states and 314342 transitions. [2024-02-09 23:27:53,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121908 states and 314342 transitions. [2024-02-09 23:27:55,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121908 to 93183. [2024-02-09 23:27:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93183 states, 93183 states have (on average 2.6672676346543898) internal successors, (248544), 93182 states have internal predecessors, (248544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93183 states to 93183 states and 248544 transitions. [2024-02-09 23:27:55,491 INFO L240 hiAutomatonCegarLoop]: Abstraction has 93183 states and 248544 transitions. [2024-02-09 23:27:55,491 INFO L428 stractBuchiCegarLoop]: Abstraction has 93183 states and 248544 transitions. [2024-02-09 23:27:55,491 INFO L335 stractBuchiCegarLoop]: ======== Iteration 39 ============ [2024-02-09 23:27:55,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93183 states and 248544 transitions. [2024-02-09 23:27:56,142 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 8176 [2024-02-09 23:27:56,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:27:56,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:27:56,143 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:27:56,143 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2024-02-09 23:27:56,144 INFO L748 eck$LassoCheckResult]: Stem: 2281390#[$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[] 2281324#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 2281326#[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] 2282028#[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] 2281750#[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] 2281752#[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] 2281904#[L68-1, 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] 2282204#[L68-1, 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] 2283114#[L68-1, 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] 2283108#[L68-1, L67, ULTIMATE.startFINAL]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] 2283094#[L68-1, ULTIMATE.startFINAL, L68-1]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] 2283096#[L68-1, ULTIMATE.startFINAL, L54-1]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] 2296686#[L68-1, 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[] 2338890#[L68-1, 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[] 2338894#[L68-1, ULTIMATE.startFINAL, L59]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] 2350304#[L68-1, 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] 2298004#[L68-1, ULTIMATE.startFINAL, L54]don't care [2024-02-09 23:27:56,144 INFO L750 eck$LassoCheckResult]: Loop: 2298004#[L68-1, 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] 2367600#[L68-1, L67, 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] 2367598#[L67, ULTIMATE.startFINAL, L39-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] 2367596#[L40, L67, 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[] 2367570#[L67, 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[] 2367486#[L67, ULTIMATE.startFINAL, L44]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] 2367482#[L67, 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] 2367478#[L67, ULTIMATE.startFINAL, L39]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] 2367472#[L67, ULTIMATE.startFINAL, L67]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] 2377230#[L68-1, L67, 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] 2367428#[L67, ULTIMATE.startFINAL, L39-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] 2377990#[L40, L67, 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[] 2358970#[L67, 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[] 2358952#[L67, ULTIMATE.startFINAL, L44]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] 2358760#[L67, 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] 2358616#[L67, ULTIMATE.startFINAL, L39]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] 2358154#[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] 2356462#[ULTIMATE.startFINAL, L67, L68-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] 2355896#[L68-1, ULTIMATE.startFINAL, L68-1]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] 2346042#[L68-1, ULTIMATE.startFINAL, L54-1]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] 2355716#[L68-1, 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[] 2355700#[L68-1, 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[] 2345202#[L68-1, ULTIMATE.startFINAL, L59]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] 2355732#[L68-1, 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] 2297352#[L68-1, 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] 2360496#[L68-1, L67, ULTIMATE.startFINAL]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] 2357556#[L68-1, ULTIMATE.startFINAL, L68-1]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] 2310656#[L68-1, ULTIMATE.startFINAL, L54-1]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] 2357490#[L68-1, 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[] 2357474#[L68-1, 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[] 2357454#[L68-1, ULTIMATE.startFINAL, L59]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] 2356342#[L68-1, 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] 2298004#[L68-1, ULTIMATE.startFINAL, L54]don't care [2024-02-09 23:27:56,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:56,145 INFO L85 PathProgramCache]: Analyzing trace with hash -138096920, now seen corresponding path program 10 times [2024-02-09 23:27:56,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:56,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115706716] [2024-02-09 23:27:56,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:56,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:56,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:56,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:56,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:56,153 INFO L85 PathProgramCache]: Analyzing trace with hash 485800489, now seen corresponding path program 14 times [2024-02-09 23:27:56,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:56,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625426416] [2024-02-09 23:27:56,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:56,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:56,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:56,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:56,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:56,165 INFO L85 PathProgramCache]: Analyzing trace with hash 732704016, now seen corresponding path program 14 times [2024-02-09 23:27:56,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:27:56,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548789966] [2024-02-09 23:27:56,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:27:56,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:27:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:56,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:27:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:27:56,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:27:56,784 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:27:56,784 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:27:56,784 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:27:56,784 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:27:56,784 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:27:56,784 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:56,784 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:27:56,784 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:27:56,784 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration39_Lasso [2024-02-09 23:27:56,784 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:27:56,784 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:27:56,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:56,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:56,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:56,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:56,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:56,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:56,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:27:57,136 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:27:57,136 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:27:57,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:57,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:57,137 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:57,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2024-02-09 23:27:57,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:57,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:57,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:57,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:57,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:57,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:57,146 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:57,148 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:57,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2024-02-09 23:27:57,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:57,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:57,151 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:57,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2024-02-09 23:27:57,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:57,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:57,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:27:57,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:57,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:57,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:57,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:27:57,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:27:57,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:57,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:57,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:57,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:57,162 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:57,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2024-02-09 23:27:57,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:57,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:57,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:57,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:57,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:57,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:57,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:57,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:57,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:57,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:57,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:57,176 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:57,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2024-02-09 23:27:57,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:57,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:57,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:27:57,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:57,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:57,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:57,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:27:57,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:27:57,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:57,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2024-02-09 23:27:57,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:57,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:57,188 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:57,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2024-02-09 23:27:57,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:57,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:57,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:57,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:57,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:57,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:57,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:57,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:27:57,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:57,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:57,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:57,202 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:57,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2024-02-09 23:27:57,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:27:57,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:27:57,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:27:57,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:27:57,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:27:57,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:27:57,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:27:57,231 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:27:57,255 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2024-02-09 23:27:57,255 INFO L444 ModelExtractionUtils]: 6 out of 25 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-02-09 23:27:57,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:27:57,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:27:57,256 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:27:57,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2024-02-09 23:27:57,258 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:27:57,264 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-02-09 23:27:57,264 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:27:57,264 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerThread1of1ForFork1_steal_x#1, N) = -1*workerThread1of1ForFork1_steal_x#1 + 1*N Supporting invariants [-1*workerThread1of1ForFork1_steal_x#1 + 1*cnt >= 0] [2024-02-09 23:27:57,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2024-02-09 23:27:57,278 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-02-09 23:27:57,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:57,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-09 23:27:57,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:57,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:27:57,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:57,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Forceful destruction successful, exit code 0 [2024-02-09 23:27:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:58,096 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 13 loop predicates [2024-02-09 23:27:58,096 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93183 states and 248544 transitions. cyclomatic complexity: 157195 Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:58,582 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93183 states and 248544 transitions. cyclomatic complexity: 157195. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 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 93505 states and 249209 transitions. Complement of second has 3 states. [2024-02-09 23:27:58,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-02-09 23:27:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2024-02-09 23:27:58,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 16 letters. Loop has 32 letters. [2024-02-09 23:27:58,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:58,583 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:27:58,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:58,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-09 23:27:58,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:58,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjunts are in the unsatisfiable core [2024-02-09 23:27:58,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:27:59,244 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 14 loop predicates [2024-02-09 23:27:59,244 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93183 states and 248544 transitions. cyclomatic complexity: 157195 Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:59,796 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93183 states and 248544 transitions. cyclomatic complexity: 157195. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 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 93505 states and 249209 transitions. Complement of second has 3 states. [2024-02-09 23:27:59,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-02-09 23:27:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:27:59,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2024-02-09 23:27:59,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 16 letters. Loop has 32 letters. [2024-02-09 23:27:59,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:27:59,797 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:27:59,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:27:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:59,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-09 23:27:59,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:27:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:27:59,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-09 23:27:59,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:28:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:28:00,615 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 13 loop predicates [2024-02-09 23:28:00,615 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93183 states and 248544 transitions. cyclomatic complexity: 157195 Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:28:03,858 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93183 states and 248544 transitions. cyclomatic complexity: 157195. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 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 223946 states and 566528 transitions. Complement of second has 115 states. [2024-02-09 23:28:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 33 states 4 stem states 27 non-accepting loop states 2 accepting loop states [2024-02-09 23:28:03,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:28:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 284 transitions. [2024-02-09 23:28:03,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 284 transitions. Stem has 16 letters. Loop has 32 letters. [2024-02-09 23:28:03,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:28:03,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 284 transitions. Stem has 48 letters. Loop has 32 letters. [2024-02-09 23:28:03,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:28:03,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 284 transitions. Stem has 16 letters. Loop has 64 letters. [2024-02-09 23:28:03,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:28:03,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223946 states and 566528 transitions. [2024-02-09 23:28:05,777 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 31124 [2024-02-09 23:28:06,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223946 states to 195396 states and 494730 transitions. [2024-02-09 23:28:06,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23130 [2024-02-09 23:28:06,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25835 [2024-02-09 23:28:06,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195396 states and 494730 transitions. [2024-02-09 23:28:06,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:28:06,951 INFO L218 hiAutomatonCegarLoop]: Abstraction has 195396 states and 494730 transitions. [2024-02-09 23:28:07,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195396 states and 494730 transitions. [2024-02-09 23:28:09,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195396 to 133533. [2024-02-09 23:28:09,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133533 states, 133533 states have (on average 2.628174308972314) internal successors, (350948), 133532 states have internal predecessors, (350948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:28:10,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133533 states to 133533 states and 350948 transitions. [2024-02-09 23:28:10,694 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133533 states and 350948 transitions. [2024-02-09 23:28:10,694 INFO L428 stractBuchiCegarLoop]: Abstraction has 133533 states and 350948 transitions. [2024-02-09 23:28:10,694 INFO L335 stractBuchiCegarLoop]: ======== Iteration 40 ============ [2024-02-09 23:28:10,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133533 states and 350948 transitions. [2024-02-09 23:28:11,159 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 17882 [2024-02-09 23:28:11,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:28:11,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:28:11,162 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:28:11,162 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2024-02-09 23:28:11,162 INFO L748 eck$LassoCheckResult]: Stem: 2879398#[$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[] 2879346#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 2879348#[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] 2879956#[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] 2879714#[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] 2879716#[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] 2879856#[L68-1, 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] 2880116#[L68-1, 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] 2880614#[L68-1, 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] 2880608#[L68-1, L67, ULTIMATE.startFINAL]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] 2880596#[L68-1, ULTIMATE.startFINAL, L68-1]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] 2880598#[L68-1, ULTIMATE.startFINAL, L54-1]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] 2988152#[L68-1, 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[] 3047926#[L68-1, 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[] 3057424#[L68-1, ULTIMATE.startFINAL, L59]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] 3057448#[L68-1, 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] 3047956#[L68-1, ULTIMATE.startFINAL, L54]don't care [2024-02-09 23:28:11,162 INFO L750 eck$LassoCheckResult]: Loop: 3047956#[L68-1, 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] 3129120#[L68-1, L67, 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] 3129114#[L67, ULTIMATE.startFINAL, L39-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] 3129108#[L40, L67, 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[] 3129100#[L67, 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[] 3129096#[L67, ULTIMATE.startFINAL, L44]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] 3128990#[L67, 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] 3128976#[L67, ULTIMATE.startFINAL, L39]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] 3128970#[L67, ULTIMATE.startFINAL, L67]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] 3129086#[L68-1, L67, 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] 3128934#[L67, ULTIMATE.startFINAL, L39-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] 3128700#[L40, L67, 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[] 3128686#[L67, 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[] 3128670#[L67, ULTIMATE.startFINAL, L44]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] 3128650#[L67, ULTIMATE.startFINAL, L38]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] 3124058#[ULTIMATE.startFINAL, L38, L68-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] 3122632#[ULTIMATE.startFINAL, L68-1, L39]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] 3122444#[ULTIMATE.startFINAL, L67, L68-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] 3122446#[L68-1, ULTIMATE.startFINAL, L68-1]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] 3125752#[L68-1, ULTIMATE.startFINAL, L54-1]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] 3125224#[L68-1, 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[] 3115142#[L68-1, 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[] 3077858#[L68-1, ULTIMATE.startFINAL, L59]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] 3124032#[L68-1, 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] 2924458#[L68-1, 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] 3133052#[L68-1, L67, ULTIMATE.startFINAL]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] 3093026#[L68-1, ULTIMATE.startFINAL, L68-1]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] 3066488#[L68-1, ULTIMATE.startFINAL, L54-1]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] 3120720#[L68-1, 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[] 3115070#[L68-1, 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[] 3120702#[L68-1, ULTIMATE.startFINAL, L59]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] 3120698#[L68-1, 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] 3047956#[L68-1, ULTIMATE.startFINAL, L54]don't care [2024-02-09 23:28:11,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:28:11,162 INFO L85 PathProgramCache]: Analyzing trace with hash -138096920, now seen corresponding path program 11 times [2024-02-09 23:28:11,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:28:11,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561482764] [2024-02-09 23:28:11,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:28:11,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:28:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:28:11,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:28:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:28:11,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:28:11,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:28:11,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1858403813, now seen corresponding path program 15 times [2024-02-09 23:28:11,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:28:11,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368674811] [2024-02-09 23:28:11,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:28:11,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:28:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:28:11,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:28:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:28:11,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:28:11,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:28:11,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2105307340, now seen corresponding path program 15 times [2024-02-09 23:28:11,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:28:11,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620521733] [2024-02-09 23:28:11,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:28:11,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:28:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:28:11,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:28:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:28:11,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:28:12,029 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:28:12,029 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:28:12,029 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:28:12,029 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:28:12,029 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:28:12,029 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:28:12,029 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:28:12,029 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:28:12,029 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration40_Lasso [2024-02-09 23:28:12,029 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:28:12,029 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:28:12,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-09 23:28:12,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:28:12,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:28:12,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:28:12,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:28:12,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:28:12,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:28:12,319 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:28:12,319 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:28:12,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:28:12,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:28:12,320 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:28:12,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2024-02-09 23:28:12,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:28:12,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:28:12,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:28:12,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:28:12,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:28:12,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:28:12,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:28:12,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:28:12,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2024-02-09 23:28:12,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:28:12,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:28:12,350 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:28:12,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2024-02-09 23:28:12,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:28:12,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:28:12,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:28:12,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:28:12,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:28:12,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:28:12,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:28:12,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:28:12,360 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:28:12,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2024-02-09 23:28:12,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:28:12,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:28:12,363 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:28:12,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2024-02-09 23:28:12,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:28:12,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:28:12,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:28:12,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:28:12,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:28:12,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:28:12,371 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:28:12,374 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:28:12,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2024-02-09 23:28:12,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:28:12,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:28:12,377 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:28:12,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2024-02-09 23:28:12,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:28:12,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:28:12,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:28:12,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:28:12,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:28:12,385 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:28:12,385 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:28:12,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:28:12,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Forceful destruction successful, exit code 0 [2024-02-09 23:28:12,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:28:12,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:28:12,391 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:28:12,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2024-02-09 23:28:12,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:28:12,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:28:12,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:28:12,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:28:12,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:28:12,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:28:12,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:28:12,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:28:12,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Forceful destruction successful, exit code 0 [2024-02-09 23:28:12,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:28:12,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:28:12,405 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:28:12,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2024-02-09 23:28:12,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:28:12,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:28:12,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:28:12,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:28:12,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:28:12,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:28:12,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:28:12,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:28:12,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2024-02-09 23:28:12,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:28:12,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:28:12,418 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:28:12,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2024-02-09 23:28:12,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:28:12,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:28:12,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:28:12,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:28:12,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:28:12,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:28:12,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:28:12,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:28:12,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Forceful destruction successful, exit code 0 [2024-02-09 23:28:12,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:28:12,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:28:12,458 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:28:12,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2024-02-09 23:28:12,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:28:12,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:28:12,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:28:12,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:28:12,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:28:12,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:28:12,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:28:12,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:28:12,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:28:12,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Forceful destruction successful, exit code 0 [2024-02-09 23:28:12,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:28:12,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:28:12,469 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:28:12,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2024-02-09 23:28:12,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:28:12,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:28:12,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:28:12,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:28:12,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:28:12,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:28:12,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:28:12,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:28:12,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:28:12,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Forceful destruction successful, exit code 0 [2024-02-09 23:28:12,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:28:12,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:28:12,481 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:28:12,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2024-02-09 23:28:12,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:28:12,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:28:12,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:28:12,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:28:12,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:28:12,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:28:12,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:28:12,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:28:12,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2024-02-09 23:28:12,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:28:12,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:28:12,494 INFO L229 MonitoredProcess]: Starting monitored process 201 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:28:12,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2024-02-09 23:28:12,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:28:12,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:28:12,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:28:12,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:28:12,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:28:12,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:28:12,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:28:12,504 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:28:12,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Ended with exit code 0 [2024-02-09 23:28:12,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:28:12,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:28:12,507 INFO L229 MonitoredProcess]: Starting monitored process 202 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:28:12,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2024-02-09 23:28:12,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:28:12,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:28:12,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:28:12,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:28:12,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:28:12,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:28:12,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:28:12,530 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:28:12,547 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-02-09 23:28:12,547 INFO L444 ModelExtractionUtils]: 5 out of 25 variables were initially zero. Simplification set additionally 17 variables to zero. [2024-02-09 23:28:12,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:28:12,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:28:12,548 INFO L229 MonitoredProcess]: Starting monitored process 203 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:28:12,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2024-02-09 23:28:12,550 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:28:12,556 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:28:12,556 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:28:12,556 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2024-02-09 23:28:12,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Ended with exit code 0 [2024-02-09 23:28:12,564 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-02-09 23:28:12,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:28:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:28:12,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:28:12,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:28:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:28:12,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-09 23:28:12,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:28:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:28:13,112 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 12 loop predicates [2024-02-09 23:28:13,112 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133533 states and 350948 transitions. cyclomatic complexity: 219637 Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:28:13,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Forceful destruction successful, exit code 0 [2024-02-09 23:28:13,795 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133533 states and 350948 transitions. cyclomatic complexity: 219637. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 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 134949 states and 354132 transitions. Complement of second has 9 states. [2024-02-09 23:28:13,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-02-09 23:28:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:28:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2024-02-09 23:28:13,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 16 letters. Loop has 32 letters. [2024-02-09 23:28:13,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:28:13,796 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:28:13,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:28:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:28:13,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:28:13,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:28:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:28:13,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-09 23:28:13,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:28:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:28:14,607 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 12 loop predicates [2024-02-09 23:28:14,607 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133533 states and 350948 transitions. cyclomatic complexity: 219637 Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:28:15,977 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133533 states and 350948 transitions. cyclomatic complexity: 219637. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 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 151118 states and 392369 transitions. Complement of second has 23 states. [2024-02-09 23:28:15,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2024-02-09 23:28:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:28:15,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 120 transitions. [2024-02-09 23:28:15,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 120 transitions. Stem has 16 letters. Loop has 32 letters. [2024-02-09 23:28:15,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:28:15,978 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:28:15,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:28:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:28:15,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:28:15,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:28:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:28:16,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 16 conjunts are in the unsatisfiable core [2024-02-09 23:28:16,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:28:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:28:17,033 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2024-02-09 23:28:17,033 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133533 states and 350948 transitions. cyclomatic complexity: 219637 Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:28:18,057 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133533 states and 350948 transitions. cyclomatic complexity: 219637. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 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 168528 states and 437155 transitions. Complement of second has 8 states. [2024-02-09 23:28:18,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-02-09 23:28:18,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:28:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2024-02-09 23:28:18,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 16 letters. Loop has 32 letters. [2024-02-09 23:28:18,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:28:18,059 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:28:18,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:28:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:28:18,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:28:18,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:28:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:28:18,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-09 23:28:18,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:28:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:28:18,846 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 12 loop predicates [2024-02-09 23:28:18,846 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133533 states and 350948 transitions. cyclomatic complexity: 219637 Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:28:20,837 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133533 states and 350948 transitions. cyclomatic complexity: 219637. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 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 263764 states and 662023 transitions. Complement of second has 65 states. [2024-02-09 23:28:20,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2024-02-09 23:28:20,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:28:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2024-02-09 23:28:20,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 128 transitions. Stem has 16 letters. Loop has 32 letters. [2024-02-09 23:28:20,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:28:20,838 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:28:20,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:28:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:28:20,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:28:20,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:28:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:28:20,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-09 23:28:20,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:28:21,370 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:28:21,370 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 12 loop predicates [2024-02-09 23:28:21,371 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 133533 states and 350948 transitions. cyclomatic complexity: 219637 Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 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) Received shutdown request... [2024-02-09 23:28:52,948 INFO L201 PluginConnector]: Adding new model work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:28:52 BoogieIcfgContainer [2024-02-09 23:28:52,949 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:28:52,949 INFO L158 Benchmark]: Toolchain (without parser) took 210067.65ms. Allocated memory was 166.7MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 136.2MB in the beginning and 6.0GB in the end (delta: -5.8GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2024-02-09 23:28:52,949 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 166.7MB. Free memory is still 137.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:28:52,949 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.13ms. Allocated memory is still 166.7MB. Free memory was 136.2MB in the beginning and 134.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-09 23:28:52,950 INFO L158 Benchmark]: Boogie Preprocessor took 17.41ms. Allocated memory is still 166.7MB. Free memory was 134.0MB in the beginning and 133.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-09 23:28:52,950 INFO L158 Benchmark]: RCFGBuilder took 295.59ms. Allocated memory is still 166.7MB. Free memory was 133.0MB in the beginning and 120.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-02-09 23:28:52,950 INFO L158 Benchmark]: BuchiAutomizer took 209717.91ms. Allocated memory was 166.7MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 120.1MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2024-02-09 23:28:52,951 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.12ms. Allocated memory is still 166.7MB. Free memory is still 137.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.13ms. Allocated memory is still 166.7MB. Free memory was 136.2MB in the beginning and 134.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.41ms. Allocated memory is still 166.7MB. Free memory was 134.0MB in the beginning and 133.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 295.59ms. Allocated memory is still 166.7MB. Free memory was 133.0MB in the beginning and 120.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 209717.91ms. Allocated memory was 166.7MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 120.1MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Decomposition not yet finished - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 209.6s and 40 iterations. TraceHistogramMax:2. Analysis of lassos took 67.7s. Construction of modules took 7.6s. Büchi inclusion checks took 106.6s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 39. Automata minimization 14.0s AutomataMinimizationTime, 39 MinimizatonAttempts, 239103 StatesRemovedByMinimization, 39 NontrivialMinimizations. Non-live state removal took 10.6s Buchi closure took 0.2s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [13, 2, 17, 2, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 10/16 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11196 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11187 mSDsluCounter, 24849 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19367 mSDsCounter, 1332 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14559 IncrementalHoareTripleChecker+Invalid, 15891 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1332 mSolverCounterUnsat, 5482 mSDtfsCounter, 14559 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU1 SILI0 SILT0 lasso35 LassoPreprocessingBenchmarks: Lassos: inital190 mio100 ax100 hnf100 lsp534 ukn21 mio100 lsp94 div100 bol100 ite100 ukn100 eq183 hnf96 smp90 dnf766 smp31 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 559ms VariablesStem: 9 VariablesLoop: 15 DisjunctsStem: 3 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 64 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while BuchiAutomatonCegarLoop was applying stage 4,while ReachableStatesComputation was computing reachable states (1060376 states constructed, input type BuchiIntersectNwa). RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown