/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:28:02,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:28:02,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 00:28:02,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:28:02,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:28:02,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:28:02,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:28:02,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:28:02,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:28:02,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:28:02,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:28:02,179 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:28:02,179 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:28:02,180 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:28:02,181 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:28:02,193 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:28:02,193 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:28:02,193 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:28:02,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:28:02,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:28:02,194 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:28:02,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:28:02,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:28:02,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:28:02,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:28:02,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:28:02,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:28:02,196 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:28:02,196 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:28:02,196 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:28:02,197 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:28:02,197 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:28:02,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:28:02,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:28:02,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:28:02,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:28:02,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:28:02,199 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:28:02,199 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 00:28:02,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:28:02,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:28:02,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:28:02,632 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:28:02,633 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:28:02,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency1.bpl [2024-02-10 00:28:02,635 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency1.bpl' [2024-02-10 00:28:02,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:28:02,691 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:28:02,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:28:02,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:28:02,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:28:02,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:02" (1/1) ... [2024-02-10 00:28:02,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:02" (1/1) ... [2024-02-10 00:28:02,796 INFO L138 Inliner]: procedures = 3, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 00:28:02,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:28:02,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:28:02,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:28:02,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:28:02,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:02" (1/1) ... [2024-02-10 00:28:02,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:02" (1/1) ... [2024-02-10 00:28:02,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:02" (1/1) ... [2024-02-10 00:28:02,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:02" (1/1) ... [2024-02-10 00:28:02,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:02" (1/1) ... [2024-02-10 00:28:02,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:02" (1/1) ... [2024-02-10 00:28:02,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:02" (1/1) ... [2024-02-10 00:28:02,818 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:02" (1/1) ... [2024-02-10 00:28:02,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:28:02,822 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:28:02,822 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:28:02,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:28:02,823 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:02" (1/1) ... [2024-02-10 00:28:02,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:02,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:02,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:28:02,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-10 00:28:02,947 INFO L124 BoogieDeclarations]: Specification and implementation of procedure reader given in one single declaration [2024-02-10 00:28:02,947 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-02-10 00:28:02,947 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-02-10 00:28:02,948 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:28:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:28:02,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:28:02,951 INFO L124 BoogieDeclarations]: Specification and implementation of procedure writer given in one single declaration [2024-02-10 00:28:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-02-10 00:28:02,951 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-02-10 00:28:02,952 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 00:28:03,022 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:28:03,023 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:28:03,208 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:28:03,219 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:28:03,219 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 00:28:03,228 INFO L201 PluginConnector]: Adding new model optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:28:03 BoogieIcfgContainer [2024-02-10 00:28:03,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:28:03,240 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:28:03,240 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:28:03,245 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:28:03,246 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:28:03,246 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:02" (1/2) ... [2024-02-10 00:28:03,248 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59b1b992 and model type optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:28:03, skipping insertion in model container [2024-02-10 00:28:03,248 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:28:03,248 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:28:03" (2/2) ... [2024-02-10 00:28:03,255 INFO L332 chiAutomizerObserver]: Analyzing ICFG optimistic-concurrency1.bpl [2024-02-10 00:28:03,417 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-02-10 00:28:03,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 44 transitions, 115 flow [2024-02-10 00:28:03,518 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2024-02-10 00:28:03,519 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-10 00:28:03,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 4/36 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 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-10 00:28:03,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 44 transitions, 115 flow [2024-02-10 00:28:03,541 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 36 transitions, 90 flow [2024-02-10 00:28:03,550 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:28:03,550 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:28:03,550 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:28:03,550 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:28:03,550 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:28:03,566 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:28:03,566 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:28:03,567 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:28:03,567 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:28:03,568 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 42 places, 36 transitions, 90 flow [2024-02-10 00:28:03,596 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 95 states, 92 states have (on average 1.9130434782608696) internal successors, (176), 94 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:03,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 95 states, 92 states have (on average 1.9130434782608696) internal successors, (176), 94 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:03,633 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 60 [2024-02-10 00:28:03,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:28:03,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:28:03,637 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:28:03,637 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:28:03,638 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 42 places, 36 transitions, 90 flow [2024-02-10 00:28:03,669 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 95 states, 92 states have (on average 1.9130434782608696) internal successors, (176), 94 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:03,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 95 states, 92 states have (on average 1.9130434782608696) internal successors, (176), 94 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:03,680 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 60 [2024-02-10 00:28:03,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:28:03,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:28:03,688 INFO L748 eck$LassoCheckResult]: Stem: Black: 240#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_3) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] 243#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_4) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] 245#[L59]don't care [99] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork2_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork2_thidvar0_2 1) (= v_writerThread1of1ForFork2_start_4 v_ULTIMATE.start_min1_5)) 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, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_16, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_6, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_4, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork2_j, writerThread1of1ForFork2_end, writerThread1of1ForFork2_start, writerThread1of1ForFork2_thidvar0] 247#[$Ultimate##0, L59-1]don't care [84] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork2_j_1 v_writerThread1of1ForFork2_start_1) InVars {writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_1, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork2_j] 251#[L41-1, L59-1]don't care [2024-02-10 00:28:03,688 INFO L750 eck$LassoCheckResult]: Loop: 251#[L41-1, L59-1]don't care [86] L41-1-->L42: Formula: (< v_writerThread1of1ForFork2_j_5 v_writerThread1of1ForFork2_end_3) InVars {writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_3, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_5} OutVars{writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_3, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_5} AuxVars[] AssignedVars[] 259#[L42, L59-1]don't care [88] L42-->L43: Formula: (and (<= 0 v_writerThread1of1ForFork2_j_7) (<= v_writerThread1of1ForFork2_j_7 v_N_5)) InVars {writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_7, N=v_N_5} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_7, N=v_N_5} AuxVars[] AssignedVars[] 271#[L43, L59-1]don't care [89] L43-->L44: Formula: (= (store v_A_3 v_writerThread1of1ForFork2_j_9 0) v_A_2) InVars {A=v_A_3, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_9} OutVars{A=v_A_2, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_9} AuxVars[] AssignedVars[A] 287#[L44, L59-1]don't care [90] L44-->L41-1: Formula: (= v_writerThread1of1ForFork2_j_12 (+ v_writerThread1of1ForFork2_j_11 1)) InVars {writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_11} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_12} AuxVars[] AssignedVars[writerThread1of1ForFork2_j] 251#[L41-1, L59-1]don't care [2024-02-10 00:28:03,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:03,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2842908, now seen corresponding path program 1 times [2024-02-10 00:28:03,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:03,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655627318] [2024-02-10 00:28:03,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:03,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:03,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:03,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:03,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:03,864 INFO L85 PathProgramCache]: Analyzing trace with hash 3572964, now seen corresponding path program 1 times [2024-02-10 00:28:03,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:03,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927923472] [2024-02-10 00:28:03,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:03,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:03,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:03,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:03,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:03,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1262870655, now seen corresponding path program 1 times [2024-02-10 00:28:03,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:03,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694411858] [2024-02-10 00:28:03,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:03,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:03,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:03,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:04,269 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:28:04,272 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:28:04,272 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:28:04,273 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:28:04,273 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:28:04,273 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:04,273 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:28:04,273 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:28:04,273 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency1.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:28:04,273 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:28:04,273 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:28:04,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:28:04,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:28:04,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:28:04,470 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:28:04,473 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:28:04,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:04,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:04,477 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:28:04,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:04,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:04,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:04,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:04,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:04,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:04,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:04,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-10 00:28:04,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:04,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-10 00:28:04,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:04,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:04,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:28:04,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:04,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:04,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:04,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:04,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:04,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:04,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:04,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-10 00:28:04,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:04,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-10 00:28:04,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:04,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:04,600 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:28:04,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:04,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:04,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:28:04,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:04,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:04,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:04,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-10 00:28:04,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:28:04,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:28:04,648 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:04,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-10 00:28:04,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:04,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:04,677 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:28:04,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:04,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-10 00:28:04,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:04,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:04,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:04,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:04,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:04,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:04,718 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:28:04,732 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-10 00:28:04,733 INFO L444 ModelExtractionUtils]: 8 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-02-10 00:28:04,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:04,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:04,782 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:28:04,786 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:28:04,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-10 00:28:04,807 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:28:04,807 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:28:04,807 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(writerThread1of1ForFork2_j, writerThread1of1ForFork2_end) = -1*writerThread1of1ForFork2_j + 1*writerThread1of1ForFork2_end Supporting invariants [] [2024-02-10 00:28:04,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-10 00:28:04,817 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:28:04,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:04,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:28:04,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:04,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:28:04,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:28:04,939 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-10 00:28:04,940 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. 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-10 00:28:05,051 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. 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 9 states and 556 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:28:05,052 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:28:05,052 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:28:05,053 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:28:05,072 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:28:05,073 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:28:05,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 00:28:05,079 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-10 00:28:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2024-02-10 00:28:05,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 214 transitions. Stem has 4 letters. Loop has 4 letters. [2024-02-10 00:28:05,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:05,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 214 transitions. Stem has 8 letters. Loop has 4 letters. [2024-02-10 00:28:05,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:05,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 214 transitions. Stem has 4 letters. Loop has 8 letters. [2024-02-10 00:28:05,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:05,082 INFO L428 stractBuchiCegarLoop]: Abstraction has has 51 places, 452 transitions, 2027 flow [2024-02-10 00:28:05,082 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:28:05,082 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:28:05,082 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 51 places, 452 transitions, 2027 flow [2024-02-10 00:28:05,095 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 197 states, 187 states have (on average 2.877005347593583) internal successors, (538), 196 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:05,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 197 states, 187 states have (on average 2.877005347593583) internal successors, (538), 196 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:05,102 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2024-02-10 00:28:05,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:28:05,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:28:05,104 INFO L748 eck$LassoCheckResult]: Stem: Black: 480#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_3) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] 486#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_4) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] 491#[L59]don't care [99] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork2_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork2_thidvar0_2 1) (= v_writerThread1of1ForFork2_start_4 v_ULTIMATE.start_min1_5)) 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, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_16, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_6, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_4, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork2_j, writerThread1of1ForFork2_end, writerThread1of1ForFork2_start, writerThread1of1ForFork2_thidvar0] 496#[L59-1, $Ultimate##0]don't care [93] L59-1-->$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_18, 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] 501#[L60, $Ultimate##0, $Ultimate##0]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] 509#[L60, L27, $Ultimate##0]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] 532#[L28-1, L60, $Ultimate##0]don't care [2024-02-10 00:28:05,104 INFO L750 eck$LassoCheckResult]: Loop: 532#[L28-1, L60, $Ultimate##0]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[] 570#[L29, L60, $Ultimate##0]don't care [72] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork0_i_9 v_N_2) (<= 0 v_readerThread1of1ForFork0_i_9)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} AuxVars[] AssignedVars[] 624#[L60, L30, $Ultimate##0]don't care [73] L30-->L31: Formula: (= (+ v_readerThread1of1ForFork0_sum_3 (select v_A_1 v_readerThread1of1ForFork0_i_11)) v_readerThread1of1ForFork0_sum_4) InVars {A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum] 713#[L31, L60, $Ultimate##0]don't care [74] L31-->L28-1: Formula: (= v_readerThread1of1ForFork0_i_14 (+ v_readerThread1of1ForFork0_i_13 1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_13} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_14} AuxVars[] AssignedVars[readerThread1of1ForFork0_i] 532#[L28-1, L60, $Ultimate##0]don't care [2024-02-10 00:28:05,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:05,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1562921946, now seen corresponding path program 1 times [2024-02-10 00:28:05,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:05,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090038653] [2024-02-10 00:28:05,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:05,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:05,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:05,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:05,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:05,115 INFO L85 PathProgramCache]: Analyzing trace with hash 3050629, now seen corresponding path program 1 times [2024-02-10 00:28:05,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:05,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288074531] [2024-02-10 00:28:05,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:05,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:05,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:05,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:05,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:05,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1242932778, now seen corresponding path program 1 times [2024-02-10 00:28:05,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:05,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131697052] [2024-02-10 00:28:05,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:05,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:05,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:05,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:05,263 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:28:05,263 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:28:05,263 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:28:05,263 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:28:05,263 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:28:05,263 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:05,263 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:28:05,263 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:28:05,264 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency1.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:28:05,264 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:28:05,264 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:28:05,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:28:05,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:28:05,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:28:05,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:28:05,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:28:05,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:28:05,587 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-10 00:28:06,314 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:28:06,314 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:28:06,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:06,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:06,317 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:28:06,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:06,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:06,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:06,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:06,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:06,337 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:06,337 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:06,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-10 00:28:06,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:06,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-10 00:28:06,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:06,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:06,357 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:28:06,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:06,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:06,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:06,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:06,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:06,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:06,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:06,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-10 00:28:06,386 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:06,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-10 00:28:06,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:06,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:06,395 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:28:06,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:06,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-10 00:28:06,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:06,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:06,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:06,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:06,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:06,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:06,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:06,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-10 00:28:06,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:06,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:06,521 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:28:06,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-10 00:28:06,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:06,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:06,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:06,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:06,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:06,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:06,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:06,633 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:06,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-02-10 00:28:06,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:06,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:06,671 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:28:06,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:06,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-10 00:28:06,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:06,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:06,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:06,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:06,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:06,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:06,789 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:28:06,807 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 00:28:06,808 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 00:28:06,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:06,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:06,809 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:28:06,847 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:28:06,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-10 00:28:06,874 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:28:06,874 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:28:06,875 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, readerThread1of1ForFork0_i) = 2*N - 2*readerThread1of1ForFork0_i + 1 Supporting invariants [] [2024-02-10 00:28:06,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-10 00:28:06,889 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:28:06,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:06,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:28:06,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:06,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:28:06,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:06,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:28:06,987 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-10 00:28:06,987 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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-10 00:28:07,104 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 8 states and 514 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:28:07,105 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:28:07,105 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:28:07,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 514 transitions. [2024-02-10 00:28:07,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 514 transitions. [2024-02-10 00:28:07,111 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:28:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 514 transitions. [2024-02-10 00:28:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 514 transitions. [2024-02-10 00:28:07,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-02-10 00:28:07,493 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:28:07,494 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:28:07,516 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-10 00:28:07,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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-10 00:28:07,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2024-02-10 00:28:07,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 6 letters. Loop has 4 letters. [2024-02-10 00:28:07,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:07,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 10 letters. Loop has 4 letters. [2024-02-10 00:28:07,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:07,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 6 letters. Loop has 8 letters. [2024-02-10 00:28:07,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:07,518 INFO L428 stractBuchiCegarLoop]: Abstraction has has 63 places, 6972 transitions, 45063 flow [2024-02-10 00:28:07,518 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:28:07,518 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:28:07,518 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 63 places, 6972 transitions, 45063 flow [2024-02-10 00:28:08,009 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 489 states, 448 states have (on average 3.8236607142857144) internal successors, (1713), 488 states have internal predecessors, (1713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:08,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 489 states, 448 states have (on average 3.8236607142857144) internal successors, (1713), 488 states have internal predecessors, (1713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:08,061 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-02-10 00:28:08,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:28:08,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:28:08,063 INFO L748 eck$LassoCheckResult]: Stem: Black: 1036#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_3) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] Black: 1039#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_4) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] Black: 1051#[L59]don't care [99] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork2_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork2_thidvar0_2 1) (= v_writerThread1of1ForFork2_start_4 v_ULTIMATE.start_min1_5)) 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, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_16, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_6, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_4, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork2_j, writerThread1of1ForFork2_end, writerThread1of1ForFork2_start, writerThread1of1ForFork2_thidvar0] Black: 1065#[L59-1, $Ultimate##0]don't care [84] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork2_j_1 v_writerThread1of1ForFork2_start_1) InVars {writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_1, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork2_j] Black: 1091#[L59-1, L41-1]don't care [85] L41-1-->writerFINAL: Formula: (<= v_writerThread1of1ForFork2_end_1 v_writerThread1of1ForFork2_j_3) InVars {writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_1, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_3} OutVars{writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_1, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_3} AuxVars[] AssignedVars[] Black: 1119#[L59-1, writerFINAL]don't care [87] writerFINAL-->writerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] Black: 1215#[L59-1, writerEXIT]don't care [93] L59-1-->$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_18, 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] Black: 1313#[$Ultimate##0, writerEXIT, L60]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] Black: 1471#[writerEXIT, L27, L60]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] Black: 1700#[L60, writerEXIT, L28-1]don't care [100] writerEXIT-->L61: Formula: (= v_writerThread1of1ForFork2_thidvar0_4 1) InVars {writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_4} OutVars{writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[] Black: 1891#[L28-1, L61]don't care [68] L28-1-->readerFINAL: Formula: (<= v_readerThread1of1ForFork0_end_1 v_readerThread1of1ForFork0_i_3) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_3, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_3, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_1} AuxVars[] AssignedVars[] Black: 1959#[readerFINAL, L61]don't care [70] readerFINAL-->readerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] Black: 2099#[readerEXIT, L61]don't care [101] readerEXIT-->L62: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_4 2) (= v_ULTIMATE.start_sum_2 v_readerThread1of1ForFork0_sum_10) (= v_readerThread1of1ForFork0_thidvar1_4 2)) InVars {readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_10, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_4, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_sum=v_ULTIMATE.start_sum_2, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_10, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_4, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[ULTIMATE.start_sum] Black: 2211#[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[] Black: 2256#[L67]don't care [96] L67-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork1_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork1_thidvar0_2 2) (= v_ULTIMATE.start_min2_7 v_readerThread1of1ForFork1_start_4) (= v_readerThread1of1ForFork1_thidvar1_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{readerThread1of1ForFork1_thidvar0=v_readerThread1of1ForFork1_thidvar0_2, ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork1_thidvar1=v_readerThread1of1ForFork1_thidvar1_2, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_8, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_18, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_6, readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_4} AuxVars[] AssignedVars[readerThread1of1ForFork1_thidvar0, readerThread1of1ForFork1_thidvar1, readerThread1of1ForFork1_sum, readerThread1of1ForFork1_i, readerThread1of1ForFork1_end, readerThread1of1ForFork1_start] 2287#[$Ultimate##0, L67-1]don't care [75] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork1_sum_1 0) InVars {} OutVars{readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork1_sum] Black: 2312#[L27, L67-1]don't care [76] L27-->L28-1: Formula: (= v_readerThread1of1ForFork1_i_1 v_readerThread1of1ForFork1_start_1) InVars {readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_1} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_1, readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[readerThread1of1ForFork1_i] 2329#[L28-1, L67-1]don't care [2024-02-10 00:28:08,063 INFO L750 eck$LassoCheckResult]: Loop: 2329#[L28-1, L67-1]don't care [78] L28-1-->L29: Formula: (< v_readerThread1of1ForFork1_i_5 v_readerThread1of1ForFork1_end_3) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_5, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_3} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_5, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_3} AuxVars[] AssignedVars[] Black: 2352#[L29, L67-1]don't care [81] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork1_i_9 v_N_2) (<= 0 v_readerThread1of1ForFork1_i_9)) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_9, N=v_N_2} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_9, N=v_N_2} AuxVars[] AssignedVars[] 2399#[L30, L67-1]don't care [82] L30-->L31: Formula: (= v_readerThread1of1ForFork1_sum_4 (+ (select v_A_1 v_readerThread1of1ForFork1_i_11) v_readerThread1of1ForFork1_sum_3)) InVars {A=v_A_1, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_11, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_11, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork1_sum] Black: 2410#[L31, L67-1]don't care [83] L31-->L28-1: Formula: (= (+ v_readerThread1of1ForFork1_i_13 1) v_readerThread1of1ForFork1_i_14) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_13} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_14} AuxVars[] AssignedVars[readerThread1of1ForFork1_i] 2329#[L28-1, L67-1]don't care [2024-02-10 00:28:08,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:08,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1751564803, now seen corresponding path program 1 times [2024-02-10 00:28:08,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:08,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470758643] [2024-02-10 00:28:08,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:08,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:08,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:08,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:08,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:08,129 INFO L85 PathProgramCache]: Analyzing trace with hash 3327685, now seen corresponding path program 1 times [2024-02-10 00:28:08,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:08,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179662892] [2024-02-10 00:28:08,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:08,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:08,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:08,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:08,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:08,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1938077639, now seen corresponding path program 1 times [2024-02-10 00:28:08,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:08,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812121254] [2024-02-10 00:28:08,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:08,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:08,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:28:08,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 00:28:08,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812121254] [2024-02-10 00:28:08,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812121254] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 00:28:08,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 00:28:08,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-10 00:28:08,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766153530] [2024-02-10 00:28:08,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 00:28:08,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 00:28:08,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-10 00:28:08,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-02-10 00:28:09,032 INFO L175 Difference]: Start difference. First operand has 63 places, 6972 transitions, 45063 flow. Second operand 15 states and 660 transitions. [2024-02-10 00:28:09,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 6972 transitions, 45063 flow. Second operand 15 states and 660 transitions. [2024-02-10 00:28:09,034 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 44 [2024-02-10 00:28:09,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 00:28:10,034 INFO L124 PetriNetUnfolderBase]: 2140/2991 cut-off events. [2024-02-10 00:28:10,034 INFO L125 PetriNetUnfolderBase]: For 403/403 co-relation queries the response was YES. [2024-02-10 00:28:10,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10054 conditions, 2991 events. 2140/2991 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11143 event pairs, 0 based on Foata normal form. 0/1121 useless extension candidates. Maximal degree in co-relation 9347. Up to 1076 conditions per place. [2024-02-10 00:28:10,084 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 181 selfloop transitions, 130 changer transitions 40/899 dead transitions. [2024-02-10 00:28:10,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 899 transitions, 6390 flow [2024-02-10 00:28:10,112 INFO L231 Difference]: Finished difference. Result has 82 places, 815 transitions, 5907 flow [2024-02-10 00:28:10,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-10 00:28:10,133 INFO L428 stractBuchiCegarLoop]: Abstraction has has 82 places, 815 transitions, 5907 flow [2024-02-10 00:28:10,133 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 00:28:10,133 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:28:10,133 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 82 places, 815 transitions, 5907 flow [2024-02-10 00:28:10,325 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 811 states, 755 states have (on average 3.8543046357615895) internal successors, (2910), 810 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:10,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 811 states, 755 states have (on average 3.8543046357615895) internal successors, (2910), 810 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:10,335 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-02-10 00:28:10,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:28:10,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:28:10,337 INFO L748 eck$LassoCheckResult]: Stem: Black: 2465#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_3) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] Black: 2468#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_4) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] Black: 2480#[L59]don't care [99] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork2_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork2_thidvar0_2 1) (= v_writerThread1of1ForFork2_start_4 v_ULTIMATE.start_min1_5)) 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, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_16, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_6, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_4, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork2_j, writerThread1of1ForFork2_end, writerThread1of1ForFork2_start, writerThread1of1ForFork2_thidvar0] Black: 2494#[$Ultimate##0, L59-1]don't care [84] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork2_j_1 v_writerThread1of1ForFork2_start_1) InVars {writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_1, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork2_j] Black: 2508#[L59-1, L41-1]don't care [85] L41-1-->writerFINAL: Formula: (<= v_writerThread1of1ForFork2_end_1 v_writerThread1of1ForFork2_j_3) InVars {writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_1, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_3} OutVars{writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_1, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_3} AuxVars[] AssignedVars[] Black: 2528#[writerFINAL, L59-1]don't care [87] writerFINAL-->writerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] Black: 2599#[writerEXIT, L59-1]don't care [93] L59-1-->$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_18, 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] Black: 2687#[writerEXIT, $Ultimate##0, L60]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] Black: 2784#[writerEXIT, L60, 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] Black: 2989#[L60, writerEXIT, L28-1]don't care [100] writerEXIT-->L61: Formula: (= v_writerThread1of1ForFork2_thidvar0_4 1) InVars {writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_4} OutVars{writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[] Black: 3209#[L61, 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[] Black: 3415#[L61, L29]don't care [72] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork0_i_9 v_N_2) (<= 0 v_readerThread1of1ForFork0_i_9)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} AuxVars[] AssignedVars[] Black: 3594#[L61, L30]don't care [73] L30-->L31: Formula: (= (+ v_readerThread1of1ForFork0_sum_3 (select v_A_1 v_readerThread1of1ForFork0_i_11)) v_readerThread1of1ForFork0_sum_4) InVars {A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum] Black: 3818#[L61, L31]don't care [74] L31-->L28-1: Formula: (= v_readerThread1of1ForFork0_i_14 (+ v_readerThread1of1ForFork0_i_13 1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_13} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_14} AuxVars[] AssignedVars[readerThread1of1ForFork0_i] Black: 4080#[L28-1, L61]don't care [68] L28-1-->readerFINAL: Formula: (<= v_readerThread1of1ForFork0_end_1 v_readerThread1of1ForFork0_i_3) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_3, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_3, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_1} AuxVars[] AssignedVars[] Black: 4229#[readerFINAL, L61]don't care [70] readerFINAL-->readerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] Black: 4400#[L61, readerEXIT]don't care [101] readerEXIT-->L62: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_4 2) (= v_ULTIMATE.start_sum_2 v_readerThread1of1ForFork0_sum_10) (= v_readerThread1of1ForFork0_thidvar1_4 2)) InVars {readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_10, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_4, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_sum=v_ULTIMATE.start_sum_2, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_10, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_4, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[ULTIMATE.start_sum] 4529#[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[] Black: 4588#[L67]don't care [96] L67-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork1_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork1_thidvar0_2 2) (= v_ULTIMATE.start_min2_7 v_readerThread1of1ForFork1_start_4) (= v_readerThread1of1ForFork1_thidvar1_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{readerThread1of1ForFork1_thidvar0=v_readerThread1of1ForFork1_thidvar0_2, ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork1_thidvar1=v_readerThread1of1ForFork1_thidvar1_2, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_8, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_18, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_6, readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_4} AuxVars[] AssignedVars[readerThread1of1ForFork1_thidvar0, readerThread1of1ForFork1_thidvar1, readerThread1of1ForFork1_sum, readerThread1of1ForFork1_i, readerThread1of1ForFork1_end, readerThread1of1ForFork1_start] 4623#[L67-1, $Ultimate##0]don't care [75] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork1_sum_1 0) InVars {} OutVars{readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork1_sum] Black: 4642#[L27, L67-1]don't care [76] L27-->L28-1: Formula: (= v_readerThread1of1ForFork1_i_1 v_readerThread1of1ForFork1_start_1) InVars {readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_1} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_1, readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[readerThread1of1ForFork1_i] 4661#[L28-1, L67-1]don't care [2024-02-10 00:28:10,337 INFO L750 eck$LassoCheckResult]: Loop: 4661#[L28-1, L67-1]don't care [78] L28-1-->L29: Formula: (< v_readerThread1of1ForFork1_i_5 v_readerThread1of1ForFork1_end_3) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_5, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_3} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_5, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_3} AuxVars[] AssignedVars[] Black: 4684#[L29, L67-1]don't care [81] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork1_i_9 v_N_2) (<= 0 v_readerThread1of1ForFork1_i_9)) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_9, N=v_N_2} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_9, N=v_N_2} AuxVars[] AssignedVars[] 4719#[L67-1, L30]don't care [82] L30-->L31: Formula: (= v_readerThread1of1ForFork1_sum_4 (+ (select v_A_1 v_readerThread1of1ForFork1_i_11) v_readerThread1of1ForFork1_sum_3)) InVars {A=v_A_1, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_11, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_11, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork1_sum] Black: 4738#[L31, L67-1]don't care [83] L31-->L28-1: Formula: (= (+ v_readerThread1of1ForFork1_i_13 1) v_readerThread1of1ForFork1_i_14) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_13} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_14} AuxVars[] AssignedVars[readerThread1of1ForFork1_i] 4661#[L28-1, L67-1]don't care [2024-02-10 00:28:10,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:10,339 INFO L85 PathProgramCache]: Analyzing trace with hash 798065279, now seen corresponding path program 1 times [2024-02-10 00:28:10,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:10,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086892945] [2024-02-10 00:28:10,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:10,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:10,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:10,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:10,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:10,403 INFO L85 PathProgramCache]: Analyzing trace with hash 3327685, now seen corresponding path program 2 times [2024-02-10 00:28:10,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:10,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254089763] [2024-02-10 00:28:10,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:10,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:10,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:10,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:10,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:10,432 INFO L85 PathProgramCache]: Analyzing trace with hash 774036035, now seen corresponding path program 1 times [2024-02-10 00:28:10,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:10,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448976021] [2024-02-10 00:28:10,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:10,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:10,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:10,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:11,388 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:28:11,388 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:28:11,388 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:28:11,388 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:28:11,388 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:28:11,389 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:11,389 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:28:11,389 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:28:11,389 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency1.bpl_BEv2_Iteration4_Lasso [2024-02-10 00:28:11,389 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:28:11,389 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:28:11,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:28:11,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:28:11,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:28:11,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:28:11,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:28:11,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:28:11,686 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:28:11,686 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:28:11,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:11,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:11,687 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:28:11,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:28:11,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:11,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:11,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:11,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:11,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:11,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:11,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-10 00:28:11,720 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:28:11,732 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-10 00:28:11,733 INFO L444 ModelExtractionUtils]: 34 out of 46 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-10 00:28:11,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:11,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:11,734 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:28:11,739 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:28:11,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-10 00:28:11,755 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-02-10 00:28:11,756 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:28:11,756 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(readerThread1of1ForFork1_i, N) = -2*readerThread1of1ForFork1_i + 3*N Supporting invariants [1*N - 1 >= 0] [2024-02-10 00:28:11,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-10 00:28:11,790 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 00:28:11,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:11,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:28:11,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:11,923 WARN L260 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 00:28:11,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:11,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-10 00:28:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:28:11,951 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-10 00:28:11,952 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. 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-10 00:28:12,087 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. 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 9 states and 556 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:28:12,088 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:28:12,088 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:28:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 556 transitions. [2024-02-10 00:28:12,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 556 transitions. [2024-02-10 00:28:12,089 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:28:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 556 transitions. [2024-02-10 00:28:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 556 transitions. [2024-02-10 00:28:12,744 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:28:12,744 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:28:12,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 00:28:12,765 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-10 00:28:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2024-02-10 00:28:12,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 214 transitions. Stem has 21 letters. Loop has 4 letters. [2024-02-10 00:28:12,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:12,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 214 transitions. Stem has 25 letters. Loop has 4 letters. [2024-02-10 00:28:12,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:12,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 214 transitions. Stem has 21 letters. Loop has 8 letters. [2024-02-10 00:28:12,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:12,766 INFO L428 stractBuchiCegarLoop]: Abstraction has has 95 places, 13479 transitions, 123681 flow [2024-02-10 00:28:12,766 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-02-10 00:28:12,766 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:28:12,766 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 95 places, 13479 transitions, 123681 flow [2024-02-10 00:28:16,673 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1759 states, 1598 states have (on average 5.5306633291614515) internal successors, (8838), 1758 states have internal predecessors, (8838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:16,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1759 states, 1598 states have (on average 5.5306633291614515) internal successors, (8838), 1758 states have internal predecessors, (8838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:16,737 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-10 00:28:16,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-10 00:28:16,751 INFO L201 PluginConnector]: Adding new model optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:28:16 BoogieIcfgContainer [2024-02-10 00:28:16,752 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:28:16,752 INFO L158 Benchmark]: Toolchain (without parser) took 14060.80ms. Allocated memory was 173.0MB in the beginning and 661.7MB in the end (delta: 488.6MB). Free memory was 138.8MB in the beginning and 563.9MB in the end (delta: -425.1MB). Peak memory consumption was 393.3MB. Max. memory is 8.0GB. [2024-02-10 00:28:16,752 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.72ms. Allocated memory is still 173.0MB. Free memory was 140.0MB in the beginning and 139.9MB in the end (delta: 69.4kB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:28:16,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.66ms. Allocated memory is still 173.0MB. Free memory was 138.7MB in the beginning and 147.5MB in the end (delta: -8.8MB). Peak memory consumption was 6.0MB. Max. memory is 8.0GB. [2024-02-10 00:28:16,753 INFO L158 Benchmark]: Boogie Preprocessor took 22.85ms. Allocated memory is still 173.0MB. Free memory was 147.4MB in the beginning and 146.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:28:16,753 INFO L158 Benchmark]: RCFGBuilder took 406.50ms. Allocated memory is still 173.0MB. Free memory was 146.3MB in the beginning and 136.5MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-10 00:28:16,753 INFO L158 Benchmark]: BuchiAutomizer took 13511.53ms. Allocated memory was 173.0MB in the beginning and 661.7MB in the end (delta: 488.6MB). Free memory was 136.3MB in the beginning and 563.9MB in the end (delta: -427.6MB). Peak memory consumption was 391.5MB. Max. memory is 8.0GB. [2024-02-10 00:28:16,754 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.72ms. Allocated memory is still 173.0MB. Free memory was 140.0MB in the beginning and 139.9MB in the end (delta: 69.4kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 104.66ms. Allocated memory is still 173.0MB. Free memory was 138.7MB in the beginning and 147.5MB in the end (delta: -8.8MB). Peak memory consumption was 6.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.85ms. Allocated memory is still 173.0MB. Free memory was 147.4MB in the beginning and 146.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 406.50ms. Allocated memory is still 173.0MB. Free memory was 146.3MB in the beginning and 136.5MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 13511.53ms. Allocated memory was 173.0MB in the beginning and 661.7MB in the end (delta: 488.6MB). Free memory was 136.3MB in the beginning and 563.9MB in the end (delta: -427.6MB). Peak memory consumption was 391.5MB. 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 5 locations. One deterministic module has affine ranking function 2 * N + -2 * i + 1 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 3 * N and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.2s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 4.7s. Construction of modules took 0.5s. Büchi inclusion checks took 3.0s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. 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, 658 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 655 mSDsluCounter, 1457 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 933 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1025 IncrementalHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 524 mSDtfsCounter, 1025 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 ukn93 mio100 lsp87 div100 bol100 ite100 ukn100 eq160 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 41ms 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-10 00:28:16,808 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...