/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/optimistic-concurrency2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:25:01,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:25:01,636 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:01,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:25:01,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:25:01,642 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:01,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:25:01,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:25:01,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:25:01,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:25:01,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:25:01,696 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:25:01,696 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:25:01,697 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:25:01,697 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:25:01,697 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:25:01,697 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:25:01,697 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:25:01,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:25:01,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:25:01,698 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:25:01,698 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:25:01,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:25:01,699 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:25:01,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:25:01,699 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:25:01,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:25:01,700 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:25:01,700 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:25:01,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:25:01,701 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:25:01,701 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:25:01,701 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:25:01,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:25:01,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:25:01,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:25:01,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:25:01,702 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:25:01,702 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:01,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:25:01,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:25:01,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:25:01,988 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-09 23:25:01,989 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-09 23:25:01,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency2.bpl [2024-02-09 23:25:01,990 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency2.bpl' [2024-02-09 23:25:02,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:25:02,017 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-09 23:25:02,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:25:02,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:25:02,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:25:02,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:02" (1/1) ... [2024-02-09 23:25:02,036 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:02" (1/1) ... [2024-02-09 23:25:02,075 INFO L138 Inliner]: procedures = 3, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-09 23:25:02,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:25:02,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:25:02,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:25:02,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:25:02,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:02" (1/1) ... [2024-02-09 23:25:02,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:02" (1/1) ... [2024-02-09 23:25:02,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:02" (1/1) ... [2024-02-09 23:25:02,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:02" (1/1) ... [2024-02-09 23:25:02,091 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:02" (1/1) ... [2024-02-09 23:25:02,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:02" (1/1) ... [2024-02-09 23:25:02,094 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:02" (1/1) ... [2024-02-09 23:25:02,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:02" (1/1) ... [2024-02-09 23:25:02,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:25:02,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:25:02,099 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:25:02,099 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:25:02,100 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:02" (1/1) ... [2024-02-09 23:25:02,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:02,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:02,130 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:02,150 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:02,169 INFO L124 BoogieDeclarations]: Specification and implementation of procedure reader given in one single declaration [2024-02-09 23:25:02,169 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-02-09 23:25:02,170 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-02-09 23:25:02,170 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-09 23:25:02,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:25:02,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:25:02,171 INFO L124 BoogieDeclarations]: Specification and implementation of procedure writer given in one single declaration [2024-02-09 23:25:02,171 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-02-09 23:25:02,171 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-02-09 23:25:02,172 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:02,214 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:25:02,215 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:25:02,302 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:25:02,307 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:25:02,307 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-09 23:25:02,308 INFO L201 PluginConnector]: Adding new model optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:25:02 BoogieIcfgContainer [2024-02-09 23:25:02,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:25:02,309 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:25:02,309 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:25:02,312 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:25:02,312 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:25:02,312 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:02" (1/2) ... [2024-02-09 23:25:02,313 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62c73078 and model type optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:25:02, skipping insertion in model container [2024-02-09 23:25:02,313 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:25:02,313 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:25:02" (2/2) ... [2024-02-09 23:25:02,314 INFO L332 chiAutomizerObserver]: Analyzing ICFG optimistic-concurrency2.bpl [2024-02-09 23:25:02,361 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-02-09 23:25:02,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 113 flow [2024-02-09 23:25:02,397 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2024-02-09 23:25:02,397 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-09 23:25:02,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 4/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-02-09 23:25:02,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 43 transitions, 113 flow [2024-02-09 23:25:02,403 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 88 flow [2024-02-09 23:25:02,412 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:25:02,413 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:25:02,413 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:25:02,413 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:25:02,413 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:25:02,413 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:25:02,413 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:25:02,413 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-02-09 23:25:02,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2024-02-09 23:25:02,451 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 60 [2024-02-09 23:25:02,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:02,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:02,454 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-02-09 23:25:02,454 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-02-09 23:25:02,454 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:25:02,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 94 states, but on-demand construction may add more states [2024-02-09 23:25:02,459 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 60 [2024-02-09 23:25:02,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:02,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:02,460 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-02-09 23:25:02,460 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-02-09 23:25:02,464 INFO L748 eck$LassoCheckResult]: Stem: 47#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_2) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] 50#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_3) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] 52#[L59]don't care [95] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] 54#[$Ultimate##0, L59-1]don't care [82] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork1_start_1 v_writerThread1of1ForFork1_j_1) InVars {writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_1, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] 58#[L41-1, L59-1]don't care [2024-02-09 23:25:02,464 INFO L750 eck$LassoCheckResult]: Loop: 58#[L41-1, L59-1]don't care [84] L41-1-->L42: Formula: (< v_writerThread1of1ForFork1_j_5 v_writerThread1of1ForFork1_end_3) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_5, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_3} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_5, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_3} AuxVars[] AssignedVars[] 66#[L42, L59-1]don't care [87] L42-->L43: Formula: (and (<= 0 v_writerThread1of1ForFork1_j_9) (<= v_writerThread1of1ForFork1_j_9 v_N_5)) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_9, N=v_N_5} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_9, N=v_N_5} AuxVars[] AssignedVars[] 80#[L43, L59-1]don't care [88] L43-->L44: Formula: (= (store v_A_3 v_writerThread1of1ForFork1_j_11 0) v_A_2) InVars {A=v_A_3, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_11} OutVars{A=v_A_2, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_11} AuxVars[] AssignedVars[A] 98#[L44, L59-1]don't care [89] L44-->L41-1: Formula: (= v_writerThread1of1ForFork1_j_14 (+ v_writerThread1of1ForFork1_j_13 1)) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_13} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_14} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] 58#[L41-1, L59-1]don't care [2024-02-09 23:25:02,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:02,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2842782, now seen corresponding path program 1 times [2024-02-09 23:25:02,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:02,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671625219] [2024-02-09 23:25:02,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:02,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:02,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:02,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:02,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:02,564 INFO L85 PathProgramCache]: Analyzing trace with hash 3512389, now seen corresponding path program 1 times [2024-02-09 23:25:02,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:02,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533553431] [2024-02-09 23:25:02,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:02,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:02,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:02,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:02,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:02,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1146446434, now seen corresponding path program 1 times [2024-02-09 23:25:02,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:02,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492711729] [2024-02-09 23:25:02,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:02,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:02,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:02,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:02,728 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:25:02,728 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:25:02,728 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:25:02,728 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:25:02,729 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:25:02,729 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:02,729 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:25:02,729 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:25:02,729 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration1_Lasso [2024-02-09 23:25:02,729 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:25:02,729 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:25:02,746 INFO L118 MapEliminator]: 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:02,764 INFO L118 MapEliminator]: 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:02,802 INFO L118 MapEliminator]: 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:02,875 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:25:02,878 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:25:02,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:02,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:02,882 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:02,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:02,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:02,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:02,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:02,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:02,893 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:02,896 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:02,896 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:02,914 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:02,920 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:02,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:02,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:02,922 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:02,923 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:02,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:02,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:02,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:02,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:02,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:02,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:02,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:02,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:02,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:02,952 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:02,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:02,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:02,954 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:02,956 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:02,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:25:02,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:02,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:02,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:02,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:02,970 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:02,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:03,015 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:25:03,038 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-02-09 23:25:03,038 INFO L444 ModelExtractionUtils]: 8 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-02-09 23:25:03,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:03,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:03,042 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:03,046 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:25:03,054 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:03,064 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:25:03,065 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:25:03,065 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(writerThread1of1ForFork1_j, writerThread1of1ForFork1_end) = -1*writerThread1of1ForFork1_j + 1*writerThread1of1ForFork1_end Supporting invariants [] [2024-02-09 23:25:03,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-02-09 23:25:03,071 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:25:03,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:03,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:25:03,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:03,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:25:03,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:03,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:03,204 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:03,230 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-09 23:25:03,233 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 94 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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:03,326 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 94 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 217 states and 487 transitions. Complement of second has 6 states. [2024-02-09 23:25:03,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 23:25:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2024-02-09 23:25:03,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 4 letters. Loop has 4 letters. [2024-02-09 23:25:03,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:03,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 8 letters. Loop has 4 letters. [2024-02-09 23:25:03,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:03,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 4 letters. Loop has 8 letters. [2024-02-09 23:25:03,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:03,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 217 states and 487 transitions. [2024-02-09 23:25:03,347 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 40 [2024-02-09 23:25:03,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 217 states to 156 states and 353 transitions. [2024-02-09 23:25:03,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2024-02-09 23:25:03,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2024-02-09 23:25:03,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 353 transitions. [2024-02-09 23:25:03,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:03,356 INFO L218 hiAutomatonCegarLoop]: Abstraction has 156 states and 353 transitions. [2024-02-09 23:25:03,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 353 transitions. [2024-02-09 23:25:03,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 135. [2024-02-09 23:25:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 135 states have (on average 2.2222222222222223) internal successors, (300), 134 states have internal predecessors, (300), 0 states have call successors, (0), 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:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 300 transitions. [2024-02-09 23:25:03,385 INFO L240 hiAutomatonCegarLoop]: Abstraction has 135 states and 300 transitions. [2024-02-09 23:25:03,385 INFO L428 stractBuchiCegarLoop]: Abstraction has 135 states and 300 transitions. [2024-02-09 23:25:03,385 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:25:03,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 300 transitions. [2024-02-09 23:25:03,386 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 40 [2024-02-09 23:25:03,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:03,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:03,387 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-02-09 23:25:03,387 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-02-09 23:25:03,389 INFO L748 eck$LassoCheckResult]: Stem: 665#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_2) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] 531#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_3) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] 533#[L59]don't care [95] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] 685#[$Ultimate##0, L59-1]don't care [98] L59-1-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_2 2) (= v_readerThread1of1ForFork2_start_4 v_ULTIMATE.start_min2_7) (= v_readerThread1of1ForFork2_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork2_thidvar0_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_16, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_2, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_2, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i, readerThread1of1ForFork2_thidvar0, readerThread1of1ForFork2_start, readerThread1of1ForFork2_thidvar1, readerThread1of1ForFork2_end] 725#[$Ultimate##0, $Ultimate##0, L60]don't care [74] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork2_sum_1 0) InVars {} OutVars{readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum] 569#[$Ultimate##0, L27, L60]don't care [75] L27-->L28-1: Formula: (= v_readerThread1of1ForFork2_start_1 v_readerThread1of1ForFork2_i_1) InVars {readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1} OutVars{readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_i] 573#[$Ultimate##0, L28-1, L60]don't care [2024-02-09 23:25:03,389 INFO L750 eck$LassoCheckResult]: Loop: 573#[$Ultimate##0, L28-1, L60]don't care [77] L28-1-->L29: Formula: (< v_readerThread1of1ForFork2_i_5 v_readerThread1of1ForFork2_end_3) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_5, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_3} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_5, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_3} AuxVars[] AssignedVars[] 717#[L29, $Ultimate##0, L60]don't care [79] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork2_i_7 v_N_1) (<= 0 v_readerThread1of1ForFork2_i_7)) InVars {N=v_N_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_7} OutVars{N=v_N_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_7} AuxVars[] AssignedVars[] 719#[L30, $Ultimate##0, L60]don't care [80] L30-->L31: Formula: (= v_readerThread1of1ForFork2_sum_4 (+ v_readerThread1of1ForFork2_sum_3 (select v_A_1 v_readerThread1of1ForFork2_i_9))) InVars {A=v_A_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_9, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_9, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum] 721#[$Ultimate##0, L31, L60]don't care [81] L31-->L28-1: Formula: (= v_readerThread1of1ForFork2_i_12 (+ v_readerThread1of1ForFork2_i_11 1)) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_11} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_12} AuxVars[] AssignedVars[readerThread1of1ForFork2_i] 573#[$Ultimate##0, L28-1, L60]don't care [2024-02-09 23:25:03,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:03,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1563036049, now seen corresponding path program 1 times [2024-02-09 23:25:03,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:03,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948929832] [2024-02-09 23:25:03,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:03,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:03,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:03,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:03,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:03,420 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 1 times [2024-02-09 23:25:03,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:03,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101919988] [2024-02-09 23:25:03,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:03,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:03,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:03,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:03,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:03,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1054123502, now seen corresponding path program 1 times [2024-02-09 23:25:03,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:03,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011206720] [2024-02-09 23:25:03,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:03,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:03,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:03,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:03,556 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:25:03,556 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:25:03,556 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:25:03,556 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:25:03,556 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:25:03,556 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:03,556 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:25:03,556 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:25:03,556 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration2_Lasso [2024-02-09 23:25:03,557 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:25:03,557 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:25:03,559 INFO L118 MapEliminator]: 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:03,561 INFO L118 MapEliminator]: 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:03,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:25:03,587 INFO L118 MapEliminator]: 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:03,590 INFO L118 MapEliminator]: 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:03,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:25:03,680 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:25:03,680 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:25:03,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:03,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:03,681 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:03,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:03,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:03,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:03,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:03,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:03,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:03,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:03,698 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:03,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:03,717 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:03,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:03,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:03,719 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:03,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:03,724 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:03,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:03,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:03,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:03,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:03,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:03,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:03,747 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:25:03,774 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-02-09 23:25:03,775 INFO L444 ModelExtractionUtils]: 17 out of 28 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-02-09 23:25:03,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:03,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:03,776 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:03,778 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:03,779 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:25:03,796 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:25:03,796 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:25:03,796 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(readerThread1of1ForFork2_i, readerThread1of1ForFork2_end) = -1*readerThread1of1ForFork2_i + 1*readerThread1of1ForFork2_end Supporting invariants [] [2024-02-09 23:25:03,800 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:03,801 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:25:03,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:03,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:25:03,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:03,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:25:03,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:03,845 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:03,845 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-09 23:25:03,846 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 135 states and 300 transitions. cyclomatic complexity: 181 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:03,876 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 135 states and 300 transitions. cyclomatic complexity: 181. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 320 states and 776 transitions. Complement of second has 6 states. [2024-02-09 23:25:03,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 23:25:03,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:03,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2024-02-09 23:25:03,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 6 letters. Loop has 4 letters. [2024-02-09 23:25:03,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:03,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 10 letters. Loop has 4 letters. [2024-02-09 23:25:03,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:03,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 6 letters. Loop has 8 letters. [2024-02-09 23:25:03,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:03,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 320 states and 776 transitions. [2024-02-09 23:25:03,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-02-09 23:25:03,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 320 states to 171 states and 389 transitions. [2024-02-09 23:25:03,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2024-02-09 23:25:03,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2024-02-09 23:25:03,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 389 transitions. [2024-02-09 23:25:03,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:03,884 INFO L218 hiAutomatonCegarLoop]: Abstraction has 171 states and 389 transitions. [2024-02-09 23:25:03,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 389 transitions. [2024-02-09 23:25:03,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 151. [2024-02-09 23:25:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 151 states have (on average 2.2450331125827816) internal successors, (339), 150 states have internal predecessors, (339), 0 states have call successors, (0), 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:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 339 transitions. [2024-02-09 23:25:03,891 INFO L240 hiAutomatonCegarLoop]: Abstraction has 151 states and 339 transitions. [2024-02-09 23:25:03,891 INFO L428 stractBuchiCegarLoop]: Abstraction has 151 states and 339 transitions. [2024-02-09 23:25:03,891 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:25:03,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 339 transitions. [2024-02-09 23:25:03,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-02-09 23:25:03,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:03,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:03,893 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:03,893 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-02-09 23:25:03,894 INFO L748 eck$LassoCheckResult]: Stem: 1269#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_2) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] 1163#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_3) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] 1165#[L59]don't care [95] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] 1279#[$Ultimate##0, L59-1]don't care [98] L59-1-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_2 2) (= v_readerThread1of1ForFork2_start_4 v_ULTIMATE.start_min2_7) (= v_readerThread1of1ForFork2_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork2_thidvar0_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_16, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_2, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_2, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i, readerThread1of1ForFork2_thidvar0, readerThread1of1ForFork2_start, readerThread1of1ForFork2_thidvar1, readerThread1of1ForFork2_end] 1333#[$Ultimate##0, $Ultimate##0, L60]don't care [82] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork1_start_1 v_writerThread1of1ForFork1_j_1) InVars {writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_1, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] 1377#[L41-1, $Ultimate##0, L60]don't care [83] L41-1-->writerFINAL: Formula: (<= v_writerThread1of1ForFork1_end_1 v_writerThread1of1ForFork1_j_3) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_3, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_3, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_1} AuxVars[] AssignedVars[] 1225#[$Ultimate##0, L60, writerFINAL]don't care [85] writerFINAL-->writerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1183#[$Ultimate##0, writerEXIT, L60]don't care [99] writerEXIT-->L61: Formula: (= v_writerThread1of1ForFork1_thidvar0_4 1) InVars {writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} OutVars{writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] 1185#[L61, $Ultimate##0]don't care [74] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork2_sum_1 0) InVars {} OutVars{readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum] 1313#[L61, L27]don't care [75] L27-->L28-1: Formula: (= v_readerThread1of1ForFork2_start_1 v_readerThread1of1ForFork2_i_1) InVars {readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1} OutVars{readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_i] 1391#[L28-1, L61]don't care [76] L28-1-->readerFINAL: Formula: (<= v_readerThread1of1ForFork2_end_1 v_readerThread1of1ForFork2_i_3) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_3, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_1} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_3, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_1} AuxVars[] AssignedVars[] 1167#[readerFINAL, L61]don't care [78] readerFINAL-->readerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1257#[readerEXIT, L61]don't care [100] readerEXIT-->L62: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_4 2) (= v_readerThread1of1ForFork2_thidvar0_4 2) (= v_readerThread1of1ForFork2_sum_10 v_ULTIMATE.start_sum_2)) InVars {readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} OutVars{ULTIMATE.start_sum=v_ULTIMATE.start_sum_2, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} AuxVars[] AssignedVars[ULTIMATE.start_sum] 1261#[L62]don't care [61] L62-->L67: Formula: (and (<= v_ULTIMATE.start_min2_1 v_ULTIMATE.start_max1_1) (<= v_ULTIMATE.start_min1_1 v_ULTIMATE.start_max2_1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_1, ULTIMATE.start_max2=v_ULTIMATE.start_max2_1, ULTIMATE.start_min1=v_ULTIMATE.start_min1_1, ULTIMATE.start_min2=v_ULTIMATE.start_min2_1} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_1, ULTIMATE.start_max2=v_ULTIMATE.start_max2_1, ULTIMATE.start_min1=v_ULTIMATE.start_min1_1, ULTIMATE.start_min2=v_ULTIMATE.start_min2_1} AuxVars[] AssignedVars[] 1339#[L67]don't care [92] L67-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_2 2) (= v_readerThread1of1ForFork0_thidvar1_2 2) (= v_readerThread1of1ForFork0_start_4 v_ULTIMATE.start_min2_5) (= v_readerThread1of1ForFork0_end_6 v_ULTIMATE.start_max2_5)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_4, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_8, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_16, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork0_start, readerThread1of1ForFork0_sum, readerThread1of1ForFork0_i, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_end] 1295#[$Ultimate##0, L67-1]don't care [66] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork0_sum_1 0) InVars {} OutVars{readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum] 1247#[L67-1, L27]don't care [67] L27-->L28-1: Formula: (= v_readerThread1of1ForFork0_start_1 v_readerThread1of1ForFork0_i_1) InVars {readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_1, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_i] 1249#[L67-1, L28-1]don't care [2024-02-09 23:25:03,894 INFO L750 eck$LassoCheckResult]: Loop: 1249#[L67-1, L28-1]don't care [69] L28-1-->L29: Formula: (< v_readerThread1of1ForFork0_i_5 v_readerThread1of1ForFork0_end_3) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} AuxVars[] AssignedVars[] 1371#[L67-1, L29]don't care [71] L29-->L30: Formula: (and (<= 0 v_readerThread1of1ForFork0_i_7) (<= v_readerThread1of1ForFork0_i_7 v_N_1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_7, N=v_N_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_7, N=v_N_1} AuxVars[] AssignedVars[] 1159#[L67-1, L30]don't care [72] L30-->L31: Formula: (= (+ (select v_A_1 v_readerThread1of1ForFork0_i_9) v_readerThread1of1ForFork0_sum_3) v_readerThread1of1ForFork0_sum_4) InVars {A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum] 1161#[L67-1, L31]don't care [73] L31-->L28-1: Formula: (= v_readerThread1of1ForFork0_i_12 (+ v_readerThread1of1ForFork0_i_11 1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_12} AuxVars[] AssignedVars[readerThread1of1ForFork0_i] 1249#[L67-1, L28-1]don't care [2024-02-09 23:25:03,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:03,894 INFO L85 PathProgramCache]: Analyzing trace with hash -456616892, now seen corresponding path program 1 times [2024-02-09 23:25:03,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:03,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651768484] [2024-02-09 23:25:03,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:03,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:03,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:03,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:03,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:03,910 INFO L85 PathProgramCache]: Analyzing trace with hash 3049636, now seen corresponding path program 1 times [2024-02-09 23:25:03,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:03,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399722260] [2024-02-09 23:25:03,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:03,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:03,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:03,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:03,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:03,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1782399847, now seen corresponding path program 1 times [2024-02-09 23:25:03,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:03,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400766142] [2024-02-09 23:25:03,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:03,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:04,093 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:04,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-09 23:25:04,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400766142] [2024-02-09 23:25:04,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400766142] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-09 23:25:04,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-09 23:25:04,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-09 23:25:04,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848185155] [2024-02-09 23:25:04,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-09 23:25:04,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-09 23:25:04,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-09 23:25:04,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-02-09 23:25:04,126 INFO L87 Difference]: Start difference. First operand 151 states and 339 transitions. cyclomatic complexity: 202 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:04,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-02-09 23:25:04,241 INFO L93 Difference]: Finished difference Result 253 states and 554 transitions. [2024-02-09 23:25:04,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 253 states and 554 transitions. [2024-02-09 23:25:04,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-02-09 23:25:04,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 253 states to 219 states and 480 transitions. [2024-02-09 23:25:04,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2024-02-09 23:25:04,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2024-02-09 23:25:04,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 480 transitions. [2024-02-09 23:25:04,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:04,260 INFO L218 hiAutomatonCegarLoop]: Abstraction has 219 states and 480 transitions. [2024-02-09 23:25:04,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 480 transitions. [2024-02-09 23:25:04,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 152. [2024-02-09 23:25:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 152 states have (on average 2.1973684210526314) internal successors, (334), 151 states have internal predecessors, (334), 0 states have call successors, (0), 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:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 334 transitions. [2024-02-09 23:25:04,268 INFO L240 hiAutomatonCegarLoop]: Abstraction has 152 states and 334 transitions. [2024-02-09 23:25:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-09 23:25:04,270 INFO L428 stractBuchiCegarLoop]: Abstraction has 152 states and 334 transitions. [2024-02-09 23:25:04,270 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-09 23:25:04,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 334 transitions. [2024-02-09 23:25:04,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-02-09 23:25:04,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:04,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:04,272 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:04,272 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-02-09 23:25:04,272 INFO L748 eck$LassoCheckResult]: Stem: 1844#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_2) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] 1738#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_3) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] 1740#[L59]don't care [95] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] 1864#[$Ultimate##0, L59-1]don't care [98] L59-1-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_2 2) (= v_readerThread1of1ForFork2_start_4 v_ULTIMATE.start_min2_7) (= v_readerThread1of1ForFork2_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork2_thidvar0_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_16, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_2, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_2, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i, readerThread1of1ForFork2_thidvar0, readerThread1of1ForFork2_start, readerThread1of1ForFork2_thidvar1, readerThread1of1ForFork2_end] 1904#[$Ultimate##0, $Ultimate##0, L60]don't care [82] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork1_start_1 v_writerThread1of1ForFork1_j_1) InVars {writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_1, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] 1950#[L41-1, $Ultimate##0, L60]don't care [83] L41-1-->writerFINAL: Formula: (<= v_writerThread1of1ForFork1_end_1 v_writerThread1of1ForFork1_j_3) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_3, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_3, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_1} AuxVars[] AssignedVars[] 1798#[$Ultimate##0, L60, writerFINAL]don't care [85] writerFINAL-->writerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1758#[$Ultimate##0, writerEXIT, L60]don't care [99] writerEXIT-->L61: Formula: (= v_writerThread1of1ForFork1_thidvar0_4 1) InVars {writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} OutVars{writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] 1760#[L61, $Ultimate##0]don't care [74] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork2_sum_1 0) InVars {} OutVars{readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum] 1886#[L61, L27]don't care [75] L27-->L28-1: Formula: (= v_readerThread1of1ForFork2_start_1 v_readerThread1of1ForFork2_i_1) InVars {readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1} OutVars{readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_i] 1964#[L28-1, L61]don't care [77] L28-1-->L29: Formula: (< v_readerThread1of1ForFork2_i_5 v_readerThread1of1ForFork2_end_3) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_5, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_3} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_5, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_3} AuxVars[] AssignedVars[] 1842#[L61, L29]don't care [79] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork2_i_7 v_N_1) (<= 0 v_readerThread1of1ForFork2_i_7)) InVars {N=v_N_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_7} OutVars{N=v_N_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_7} AuxVars[] AssignedVars[] 1806#[L61, L30]don't care [80] L30-->L31: Formula: (= v_readerThread1of1ForFork2_sum_4 (+ v_readerThread1of1ForFork2_sum_3 (select v_A_1 v_readerThread1of1ForFork2_i_9))) InVars {A=v_A_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_9, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_9, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum] 1840#[L31, L61]don't care [81] L31-->L28-1: Formula: (= v_readerThread1of1ForFork2_i_12 (+ v_readerThread1of1ForFork2_i_11 1)) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_11} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_12} AuxVars[] AssignedVars[readerThread1of1ForFork2_i] 1870#[L28-1, L61]don't care [76] L28-1-->readerFINAL: Formula: (<= v_readerThread1of1ForFork2_end_1 v_readerThread1of1ForFork2_i_3) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_3, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_1} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_3, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_1} AuxVars[] AssignedVars[] 1742#[readerFINAL, L61]don't care [78] readerFINAL-->readerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1830#[readerEXIT, L61]don't care [100] readerEXIT-->L62: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_4 2) (= v_readerThread1of1ForFork2_thidvar0_4 2) (= v_readerThread1of1ForFork2_sum_10 v_ULTIMATE.start_sum_2)) InVars {readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} OutVars{ULTIMATE.start_sum=v_ULTIMATE.start_sum_2, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} AuxVars[] AssignedVars[ULTIMATE.start_sum] 1836#[L62]don't care [61] L62-->L67: Formula: (and (<= v_ULTIMATE.start_min2_1 v_ULTIMATE.start_max1_1) (<= v_ULTIMATE.start_min1_1 v_ULTIMATE.start_max2_1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_1, ULTIMATE.start_max2=v_ULTIMATE.start_max2_1, ULTIMATE.start_min1=v_ULTIMATE.start_min1_1, ULTIMATE.start_min2=v_ULTIMATE.start_min2_1} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_1, ULTIMATE.start_max2=v_ULTIMATE.start_max2_1, ULTIMATE.start_min1=v_ULTIMATE.start_min1_1, ULTIMATE.start_min2=v_ULTIMATE.start_min2_1} AuxVars[] AssignedVars[] 1916#[L67]don't care [92] L67-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_2 2) (= v_readerThread1of1ForFork0_thidvar1_2 2) (= v_readerThread1of1ForFork0_start_4 v_ULTIMATE.start_min2_5) (= v_readerThread1of1ForFork0_end_6 v_ULTIMATE.start_max2_5)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_4, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_8, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_16, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork0_start, readerThread1of1ForFork0_sum, readerThread1of1ForFork0_i, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_end] 1868#[$Ultimate##0, L67-1]don't care [66] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork0_sum_1 0) InVars {} OutVars{readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum] 1824#[L67-1, L27]don't care [67] L27-->L28-1: Formula: (= v_readerThread1of1ForFork0_start_1 v_readerThread1of1ForFork0_i_1) InVars {readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_1, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_i] 1826#[L67-1, L28-1]don't care [2024-02-09 23:25:04,273 INFO L750 eck$LassoCheckResult]: Loop: 1826#[L67-1, L28-1]don't care [69] L28-1-->L29: Formula: (< v_readerThread1of1ForFork0_i_5 v_readerThread1of1ForFork0_end_3) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} AuxVars[] AssignedVars[] 1944#[L67-1, L29]don't care [71] L29-->L30: Formula: (and (<= 0 v_readerThread1of1ForFork0_i_7) (<= v_readerThread1of1ForFork0_i_7 v_N_1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_7, N=v_N_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_7, N=v_N_1} AuxVars[] AssignedVars[] 1728#[L67-1, L30]don't care [72] L30-->L31: Formula: (= (+ (select v_A_1 v_readerThread1of1ForFork0_i_9) v_readerThread1of1ForFork0_sum_3) v_readerThread1of1ForFork0_sum_4) InVars {A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum] 1730#[L67-1, L31]don't care [73] L31-->L28-1: Formula: (= v_readerThread1of1ForFork0_i_12 (+ v_readerThread1of1ForFork0_i_11 1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_12} AuxVars[] AssignedVars[readerThread1of1ForFork0_i] 1826#[L67-1, L28-1]don't care [2024-02-09 23:25:04,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:04,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1133404865, now seen corresponding path program 1 times [2024-02-09 23:25:04,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:04,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749218768] [2024-02-09 23:25:04,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:04,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:04,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:04,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:04,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:04,287 INFO L85 PathProgramCache]: Analyzing trace with hash 3049636, now seen corresponding path program 2 times [2024-02-09 23:25:04,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:04,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870402267] [2024-02-09 23:25:04,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:04,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:04,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:04,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:04,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:04,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1011714916, now seen corresponding path program 1 times [2024-02-09 23:25:04,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:04,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597609174] [2024-02-09 23:25:04,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:04,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:04,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:04,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:04,578 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:25:04,579 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:25:04,579 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:25:04,579 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:25:04,579 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:25:04,579 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:04,579 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:25:04,579 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:25:04,579 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration4_Lasso [2024-02-09 23:25:04,579 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:25:04,579 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:25:04,580 INFO L118 MapEliminator]: 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:04,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:25:04,664 INFO L118 MapEliminator]: 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:04,668 INFO L118 MapEliminator]: 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:04,673 INFO L118 MapEliminator]: 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:04,675 INFO L118 MapEliminator]: 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:04,832 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:25:04,833 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:25:04,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:04,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:04,853 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:04,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:25:04,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:04,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:04,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:04,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:04,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:04,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:04,869 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:04,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:04,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-02-09 23:25:04,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:04,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:04,910 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:04,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:04,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:04,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:04,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:04,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:04,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:04,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:04,928 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:04,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:04,954 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:04,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:04,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:04,956 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:04,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-02-09 23:25:05,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:05,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:05,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:05,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:05,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:05,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:05,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:05,028 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:05,032 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:25:05,045 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-02-09 23:25:05,045 INFO L444 ModelExtractionUtils]: 34 out of 46 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-02-09 23:25:05,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:05,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:05,046 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:05,051 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:25:05,064 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:05,072 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:25:05,073 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:25:05,073 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(readerThread1of1ForFork0_i, N) = -2*readerThread1of1ForFork0_i + 2*N + 1 Supporting invariants [] [2024-02-09 23:25:05,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-02-09 23:25:05,079 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:25:05,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:05,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:25:05,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:05,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:25:05,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:05,138 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:05,138 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-09 23:25:05,139 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 152 states and 334 transitions. cyclomatic complexity: 196 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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:05,156 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 152 states and 334 transitions. cyclomatic complexity: 196. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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 156 states and 339 transitions. Complement of second has 6 states. [2024-02-09 23:25:05,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 23:25:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2024-02-09 23:25:05,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 21 letters. Loop has 4 letters. [2024-02-09 23:25:05,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:05,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 25 letters. Loop has 4 letters. [2024-02-09 23:25:05,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:05,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 21 letters. Loop has 8 letters. [2024-02-09 23:25:05,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:05,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 339 transitions. [2024-02-09 23:25:05,160 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-09 23:25:05,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 0 states and 0 transitions. [2024-02-09 23:25:05,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-02-09 23:25:05,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-02-09 23:25:05,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-02-09 23:25:05,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-02-09 23:25:05,161 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-02-09 23:25:05,161 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-02-09 23:25:05,161 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-02-09 23:25:05,161 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-02-09 23:25:05,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-02-09 23:25:05,161 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-09 23:25:05,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-09 23:25:05,167 INFO L201 PluginConnector]: Adding new model optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:25:05 BoogieIcfgContainer [2024-02-09 23:25:05,167 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:25:05,168 INFO L158 Benchmark]: Toolchain (without parser) took 3150.87ms. Allocated memory was 156.2MB in the beginning and 281.0MB in the end (delta: 124.8MB). Free memory was 114.0MB in the beginning and 231.3MB in the end (delta: -117.4MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. [2024-02-09 23:25:05,170 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 156.2MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:25:05,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.08ms. Allocated memory is still 156.2MB. Free memory was 113.7MB in the beginning and 131.8MB in the end (delta: -18.1MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2024-02-09 23:25:05,172 INFO L158 Benchmark]: Boogie Preprocessor took 20.90ms. Allocated memory is still 156.2MB. Free memory was 131.6MB in the beginning and 130.6MB in the end (delta: 954.0kB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:25:05,172 INFO L158 Benchmark]: RCFGBuilder took 209.43ms. Allocated memory is still 156.2MB. Free memory was 130.5MB in the beginning and 120.7MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-09 23:25:05,173 INFO L158 Benchmark]: BuchiAutomizer took 2858.39ms. Allocated memory was 156.2MB in the beginning and 281.0MB in the end (delta: 124.8MB). Free memory was 120.5MB in the beginning and 231.3MB in the end (delta: -110.8MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. [2024-02-09 23:25:05,179 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.10ms. Allocated memory is still 156.2MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.08ms. Allocated memory is still 156.2MB. Free memory was 113.7MB in the beginning and 131.8MB in the end (delta: -18.1MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.90ms. Allocated memory is still 156.2MB. Free memory was 131.6MB in the beginning and 130.6MB in the end (delta: 954.0kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 209.43ms. Allocated memory is still 156.2MB. Free memory was 130.5MB in the beginning and 120.7MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 2858.39ms. Allocated memory was 156.2MB in the beginning and 281.0MB in the end (delta: 124.8MB). Free memory was 120.5MB in the beginning and 231.3MB in the end (delta: -110.8MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function end + -1 * j and consists of 4 locations. One deterministic module has affine ranking function end + -1 * i and consists of 4 locations. One deterministic module has affine ranking function 2 * N + -2 * i + 1 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 108 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 187 mSDsluCounter, 350 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 218 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 146 IncrementalHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 132 mSDtfsCounter, 146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital70 mio100 ax100 hnf100 lsp83 ukn92 mio100 lsp87 div100 bol100 ite100 ukn100 eq160 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-02-09 23:25:05,194 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:05,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...