/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_AUTOMATON -i ../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:12:38,418 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:12:38,475 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:12:38,505 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:12:38,505 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:12:38,506 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:12:38,507 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:12:38,507 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:12:38,508 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:12:38,511 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:12:38,511 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:12:38,511 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:12:38,512 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:12:38,512 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:12:38,513 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:12:38,513 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:12:38,513 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:12:38,513 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:12:38,513 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:12:38,514 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:12:38,514 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:12:38,514 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:12:38,514 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:12:38,514 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:12:38,515 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:12:38,515 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:12:38,515 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:12:38,515 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:12:38,515 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:12:38,516 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:12:38,516 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:12:38,517 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:12:38,517 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:12:38,518 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:12:38,518 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_AUTOMATON [2023-10-12 17:12:38,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:12:38,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:12:38,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:12:38,721 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:12:38,722 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:12:38,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency2.bpl [2023-10-12 17:12:38,723 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency2.bpl' [2023-10-12 17:12:38,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:12:38,752 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:12:38,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:38,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:12:38,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:12:38,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:38" (1/1) ... [2023-10-12 17:12:38,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:38" (1/1) ... [2023-10-12 17:12:38,777 INFO L138 Inliner]: procedures = 3, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:12:38,778 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:38,779 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:12:38,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:12:38,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:12:38,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:38" (1/1) ... [2023-10-12 17:12:38,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:38" (1/1) ... [2023-10-12 17:12:38,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:38" (1/1) ... [2023-10-12 17:12:38,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:38" (1/1) ... [2023-10-12 17:12:38,790 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:38" (1/1) ... [2023-10-12 17:12:38,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:38" (1/1) ... [2023-10-12 17:12:38,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:38" (1/1) ... [2023-10-12 17:12:38,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:38" (1/1) ... [2023-10-12 17:12:38,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:12:38,799 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:12:38,799 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:12:38,799 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:12:38,799 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:38" (1/1) ... [2023-10-12 17:12:38,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:38,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:38,825 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) [2023-10-12 17:12:38,828 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 [2023-10-12 17:12:38,853 INFO L124 BoogieDeclarations]: Specification and implementation of procedure reader given in one single declaration [2023-10-12 17:12:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2023-10-12 17:12:38,856 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2023-10-12 17:12:38,856 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:12:38,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:12:38,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:12:38,857 INFO L124 BoogieDeclarations]: Specification and implementation of procedure writer given in one single declaration [2023-10-12 17:12:38,857 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2023-10-12 17:12:38,857 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2023-10-12 17:12:38,858 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:12:38,897 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:12:38,899 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:12:38,980 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:12:38,985 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:12:38,985 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:12:38,986 INFO L201 PluginConnector]: Adding new model optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:38 BoogieIcfgContainer [2023-10-12 17:12:38,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:12:38,987 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:12:38,987 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:12:38,999 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:12:39,000 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:39,000 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:38" (1/2) ... [2023-10-12 17:12:39,001 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@327ee97 and model type optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:12:39, skipping insertion in model container [2023-10-12 17:12:39,001 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:39,001 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:38" (2/2) ... [2023-10-12 17:12:39,002 INFO L332 chiAutomizerObserver]: Analyzing ICFG optimistic-concurrency2.bpl [2023-10-12 17:12:39,071 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2023-10-12 17:12:39,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 116 flow [2023-10-12 17:12:39,115 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2023-10-12 17:12:39,116 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:12:39,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 4/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2023-10-12 17:12:39,120 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 43 transitions, 116 flow [2023-10-12 17:12:39,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 88 flow [2023-10-12 17:12:39,129 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:12:39,142 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 35 transitions, 88 flow [2023-10-12 17:12:39,144 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 35 transitions, 88 flow [2023-10-12 17:12:39,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 88 flow [2023-10-12 17:12:39,153 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2023-10-12 17:12:39,154 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:12:39,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 4/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 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. [2023-10-12 17:12:39,155 INFO L119 LiptonReduction]: Number of co-enabled transitions 160 [2023-10-12 17:12:39,551 INFO L134 LiptonReduction]: Checked pairs total: 143 [2023-10-12 17:12:39,551 INFO L136 LiptonReduction]: Total number of compositions: 17 [2023-10-12 17:12:39,565 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:12:39,565 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:12:39,565 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:12:39,565 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:12:39,565 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:12:39,565 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:12:39,565 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:12:39,566 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:12:39,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:12:39,588 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2023-10-12 17:12:39,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:39,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:39,592 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:12:39,592 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:39,592 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:12:39,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 27 states, but on-demand construction may add more states [2023-10-12 17:12:39,594 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2023-10-12 17:12:39,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:39,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:39,594 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:12:39,594 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:39,598 INFO L748 eck$LassoCheckResult]: Stem: 47#[$Ultimate##0]don't care [114] $Ultimate##0-->L59: Formula: (and (<= 0 v_ULTIMATE.start_min2_8) (<= v_ULTIMATE.start_max2_8 v_N_14) (<= 0 v_ULTIMATE.start_min1_6) (<= v_ULTIMATE.start_max1_6 v_N_14)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_14, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_14, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} AuxVars[] AssignedVars[] 50#[L59]don't care [95] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] 52#[L59-1, $Ultimate##0]don't care [82] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork1_start_1 v_writerThread1of1ForFork1_j_1) InVars {writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_1, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] 56#[L59-1, L41-1]don't care [2023-10-12 17:12:39,598 INFO L750 eck$LassoCheckResult]: Loop: 56#[L59-1, L41-1]don't care [119] L41-1-->L41-1: Formula: (and (= v_writerThread1of1ForFork1_j_31 (+ v_writerThread1of1ForFork1_j_32 1)) (< v_writerThread1of1ForFork1_j_32 v_writerThread1of1ForFork1_end_13) (<= 0 v_writerThread1of1ForFork1_j_32) (<= v_writerThread1of1ForFork1_j_32 v_N_20) (= v_A_20 (store v_A_21 v_writerThread1of1ForFork1_j_32 0))) InVars {A=v_A_21, N=v_N_20, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_32, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_13} OutVars{A=v_A_20, N=v_N_20, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_31, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_13} AuxVars[] AssignedVars[A, writerThread1of1ForFork1_j] 56#[L59-1, L41-1]don't care [2023-10-12 17:12:39,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:39,602 INFO L85 PathProgramCache]: Analyzing trace with hash 142372, now seen corresponding path program 1 times [2023-10-12 17:12:39,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:39,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274485122] [2023-10-12 17:12:39,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:39,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:39,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:39,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:39,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:39,676 INFO L85 PathProgramCache]: Analyzing trace with hash 150, now seen corresponding path program 1 times [2023-10-12 17:12:39,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:39,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550526709] [2023-10-12 17:12:39,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:39,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:39,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:39,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:39,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:39,706 INFO L85 PathProgramCache]: Analyzing trace with hash 4413651, now seen corresponding path program 1 times [2023-10-12 17:12:39,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:39,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120836380] [2023-10-12 17:12:39,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:39,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:39,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:39,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:39,864 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:39,865 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:39,865 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:39,865 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:39,865 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:39,865 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:39,865 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:39,865 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:39,866 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:12:39,866 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:39,866 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:39,879 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:39,915 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:39,918 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:39,973 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:39,975 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:39,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:39,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:39,979 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) [2023-10-12 17:12:39,984 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 [2023-10-12 17:12:39,989 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 [2023-10-12 17:12:39,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:39,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:39,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:39,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:39,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:39,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:39,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:39,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:40,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:12:40,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:40,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:40,001 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) [2023-10-12 17:12:40,002 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 [2023-10-12 17:12:40,004 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 [2023-10-12 17:12:40,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:40,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:40,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:40,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:40,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:40,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:40,034 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:40,050 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2023-10-12 17:12:40,051 INFO L444 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 15 variables to zero. [2023-10-12 17:12:40,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:40,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:40,054 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) [2023-10-12 17:12:40,055 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 [2023-10-12 17:12:40,057 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:40,077 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:12:40,077 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:40,077 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(writerThread1of1ForFork1_j, writerThread1of1ForFork1_end) = -1*writerThread1of1ForFork1_j + 1*writerThread1of1ForFork1_end Supporting invariants [] [2023-10-12 17:12:40,083 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 [2023-10-12 17:12:40,085 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:40,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:40,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:40,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:40,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:40,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:40,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:40,164 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:12:40,166 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 27 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:40,230 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 27 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 64 states and 148 transitions. Complement of second has 4 states. [2023-10-12 17:12:40,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:40,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2023-10-12 17:12:40,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:12:40,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:40,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:12:40,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:40,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:12:40,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:40,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 148 transitions. [2023-10-12 17:12:40,251 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2023-10-12 17:12:40,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 41 states and 93 transitions. [2023-10-12 17:12:40,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-10-12 17:12:40,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2023-10-12 17:12:40,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 93 transitions. [2023-10-12 17:12:40,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:40,258 INFO L219 hiAutomatonCegarLoop]: Abstraction has 41 states and 93 transitions. [2023-10-12 17:12:40,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 93 transitions. [2023-10-12 17:12:40,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2023-10-12 17:12:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 33 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 80 transitions. [2023-10-12 17:12:40,283 INFO L241 hiAutomatonCegarLoop]: Abstraction has 34 states and 80 transitions. [2023-10-12 17:12:40,284 INFO L430 stractBuchiCegarLoop]: Abstraction has 34 states and 80 transitions. [2023-10-12 17:12:40,286 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:12:40,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 80 transitions. [2023-10-12 17:12:40,291 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2023-10-12 17:12:40,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:40,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:40,291 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:12:40,291 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:40,291 INFO L748 eck$LassoCheckResult]: Stem: 254#[$Ultimate##0]don't care [114] $Ultimate##0-->L59: Formula: (and (<= 0 v_ULTIMATE.start_min2_8) (<= v_ULTIMATE.start_max2_8 v_N_14) (<= 0 v_ULTIMATE.start_min1_6) (<= v_ULTIMATE.start_max1_6 v_N_14)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_14, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_14, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} AuxVars[] AssignedVars[] 220#[L59]don't care [95] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] 222#[L59-1, $Ultimate##0]don't care [98] L59-1-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_2 2) (= v_readerThread1of1ForFork2_start_4 v_ULTIMATE.start_min2_7) (= v_readerThread1of1ForFork2_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork2_thidvar0_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_16, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_2, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_2, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i, readerThread1of1ForFork2_thidvar0, readerThread1of1ForFork2_start, readerThread1of1ForFork2_thidvar1, readerThread1of1ForFork2_end] 232#[$Ultimate##0, $Ultimate##0, L60]don't care [109] $Ultimate##0-->L28-1: Formula: (and (= v_readerThread1of1ForFork2_sum_17 0) (= v_readerThread1of1ForFork2_i_21 v_readerThread1of1ForFork2_start_5)) InVars {readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_5} OutVars{readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_17, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_21, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i] 236#[$Ultimate##0, L28-1, L60]don't care [2023-10-12 17:12:40,292 INFO L750 eck$LassoCheckResult]: Loop: 236#[$Ultimate##0, L28-1, L60]don't care [120] L28-1-->L28-1: Formula: (and (<= v_readerThread1of1ForFork2_i_30 v_N_24) (= v_readerThread1of1ForFork2_sum_31 (+ (select v_A_28 v_readerThread1of1ForFork2_i_30) v_readerThread1of1ForFork2_sum_32)) (= v_readerThread1of1ForFork2_i_29 (+ v_readerThread1of1ForFork2_i_30 1)) (<= 0 v_readerThread1of1ForFork2_i_30) (< v_readerThread1of1ForFork2_i_30 v_readerThread1of1ForFork2_end_13)) InVars {A=v_A_28, N=v_N_24, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_32, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_30, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_13} OutVars{A=v_A_28, N=v_N_24, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_31, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_29, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_13} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i] 236#[$Ultimate##0, L28-1, L60]don't care [2023-10-12 17:12:40,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:40,292 INFO L85 PathProgramCache]: Analyzing trace with hash 4414137, now seen corresponding path program 1 times [2023-10-12 17:12:40,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:40,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608070662] [2023-10-12 17:12:40,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:40,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:40,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:40,308 INFO L85 PathProgramCache]: Analyzing trace with hash 151, now seen corresponding path program 1 times [2023-10-12 17:12:40,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:40,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224111457] [2023-10-12 17:12:40,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:40,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,329 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:40,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:40,334 INFO L85 PathProgramCache]: Analyzing trace with hash 136838367, now seen corresponding path program 1 times [2023-10-12 17:12:40,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:40,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532544468] [2023-10-12 17:12:40,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:40,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:40,453 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:40,453 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:40,454 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:40,454 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:40,454 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:40,454 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:40,454 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:40,454 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:40,454 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:12:40,454 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:40,454 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:40,456 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:40,459 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:40,467 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:40,469 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:40,471 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:40,490 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:40,572 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:40,572 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:40,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:40,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:40,574 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) [2023-10-12 17:12:40,593 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 [2023-10-12 17:12:40,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:40,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:40,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:40,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:40,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:40,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:40,605 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 [2023-10-12 17:12:40,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:40,618 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 [2023-10-12 17:12:40,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:40,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:40,620 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) [2023-10-12 17:12:40,622 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 [2023-10-12 17:12:40,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:12:40,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:40,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:40,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:40,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:40,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:40,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:40,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:40,671 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 [2023-10-12 17:12:40,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:40,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:40,673 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) [2023-10-12 17:12:40,680 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 [2023-10-12 17:12:40,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:40,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:40,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:40,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:40,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:40,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:40,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:40,691 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 [2023-10-12 17:12:40,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:40,704 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 [2023-10-12 17:12:40,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:40,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:40,705 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) [2023-10-12 17:12:40,707 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 [2023-10-12 17:12:40,708 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 [2023-10-12 17:12:40,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:40,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:40,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:40,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:40,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:40,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:40,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:40,741 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 [2023-10-12 17:12:40,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:40,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:40,743 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) [2023-10-12 17:12:40,746 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 [2023-10-12 17:12:40,747 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 [2023-10-12 17:12:40,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:40,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:40,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:40,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:40,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:40,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:40,771 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:40,776 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 [2023-10-12 17:12:40,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:40,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:40,913 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) [2023-10-12 17:12:40,914 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 [2023-10-12 17:12:40,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:12:40,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:40,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:40,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:40,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:40,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:40,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:41,012 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:41,025 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:12:41,025 INFO L444 ModelExtractionUtils]: 9 out of 28 variables were initially zero. Simplification set additionally 16 variables to zero. [2023-10-12 17:12:41,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:41,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:41,063 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) [2023-10-12 17:12:41,064 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 [2023-10-12 17:12:41,066 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:41,087 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:12:41,087 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:41,087 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(readerThread1of1ForFork2_i, readerThread1of1ForFork2_end) = -1*readerThread1of1ForFork2_i + 1*readerThread1of1ForFork2_end Supporting invariants [] [2023-10-12 17:12:41,092 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 [2023-10-12 17:12:41,093 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:41,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:41,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:41,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:41,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:41,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:41,123 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:12:41,123 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 80 transitions. cyclomatic complexity: 56 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:41,156 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 80 transitions. cyclomatic complexity: 56. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 74 states and 176 transitions. Complement of second has 4 states. [2023-10-12 17:12:41,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2023-10-12 17:12:41,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:12:41,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:41,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:12:41,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:41,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:12:41,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:41,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 176 transitions. [2023-10-12 17:12:41,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:12:41,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 51 states and 118 transitions. [2023-10-12 17:12:41,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-10-12 17:12:41,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-10-12 17:12:41,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 118 transitions. [2023-10-12 17:12:41,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:41,160 INFO L219 hiAutomatonCegarLoop]: Abstraction has 51 states and 118 transitions. [2023-10-12 17:12:41,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 118 transitions. [2023-10-12 17:12:41,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2023-10-12 17:12:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.357142857142857) internal successors, (99), 41 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 99 transitions. [2023-10-12 17:12:41,163 INFO L241 hiAutomatonCegarLoop]: Abstraction has 42 states and 99 transitions. [2023-10-12 17:12:41,163 INFO L430 stractBuchiCegarLoop]: Abstraction has 42 states and 99 transitions. [2023-10-12 17:12:41,163 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:12:41,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 99 transitions. [2023-10-12 17:12:41,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:12:41,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:41,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:41,164 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:41,164 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:41,165 INFO L748 eck$LassoCheckResult]: Stem: 437#[$Ultimate##0]don't care [114] $Ultimate##0-->L59: Formula: (and (<= 0 v_ULTIMATE.start_min2_8) (<= v_ULTIMATE.start_max2_8 v_N_14) (<= 0 v_ULTIMATE.start_min1_6) (<= v_ULTIMATE.start_max1_6 v_N_14)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_14, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_14, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} AuxVars[] AssignedVars[] 393#[L59]don't care [95] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] 395#[L59-1, $Ultimate##0]don't care [98] L59-1-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_2 2) (= v_readerThread1of1ForFork2_start_4 v_ULTIMATE.start_min2_7) (= v_readerThread1of1ForFork2_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork2_thidvar0_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_16, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_2, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_2, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i, readerThread1of1ForFork2_thidvar0, readerThread1of1ForFork2_start, readerThread1of1ForFork2_thidvar1, readerThread1of1ForFork2_end] 403#[$Ultimate##0, $Ultimate##0, L60]don't care [82] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork1_start_1 v_writerThread1of1ForFork1_j_1) InVars {writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_1, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] 405#[$Ultimate##0, L60, L41-1]don't care [109] $Ultimate##0-->L28-1: Formula: (and (= v_readerThread1of1ForFork2_sum_17 0) (= v_readerThread1of1ForFork2_i_21 v_readerThread1of1ForFork2_start_5)) InVars {readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_5} OutVars{readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_17, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_21, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i] 375#[L28-1, L60, L41-1]don't care [107] L28-1-->readerEXIT: Formula: (<= v_readerThread1of1ForFork2_end_7 v_readerThread1of1ForFork2_i_19) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_19, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_7} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_19, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_7} AuxVars[] AssignedVars[] 411#[readerEXIT, L60, L41-1]don't care [110] L41-1-->writerEXIT: Formula: (<= v_writerThread1of1ForFork1_end_7 v_writerThread1of1ForFork1_j_19) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_19, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_7} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_19, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_7} AuxVars[] AssignedVars[] 389#[readerEXIT, writerEXIT, L60]don't care [99] writerEXIT-->L61: Formula: (= v_writerThread1of1ForFork1_thidvar0_4 1) InVars {writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} OutVars{writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] 391#[L61, readerEXIT]don't care [100] readerEXIT-->L62: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_4 2) (= v_readerThread1of1ForFork2_thidvar0_4 2) (= v_readerThread1of1ForFork2_sum_10 v_ULTIMATE.start_sum_2)) InVars {readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} OutVars{ULTIMATE.start_sum=v_ULTIMATE.start_sum_2, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} AuxVars[] AssignedVars[ULTIMATE.start_sum] 401#[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[] 385#[L67]don't care [92] L67-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_2 2) (= v_readerThread1of1ForFork0_thidvar1_2 2) (= v_readerThread1of1ForFork0_start_4 v_ULTIMATE.start_min2_5) (= v_readerThread1of1ForFork0_end_6 v_ULTIMATE.start_max2_5)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_4, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_8, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_16, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork0_start, readerThread1of1ForFork0_sum, readerThread1of1ForFork0_i, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_end] 387#[$Ultimate##0, L67-1]don't care [113] $Ultimate##0-->L28-1: Formula: (and (= v_readerThread1of1ForFork0_i_25 v_readerThread1of1ForFork0_start_5) (= v_readerThread1of1ForFork0_sum_17 0)) InVars {readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5} OutVars{readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_25, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_17} AuxVars[] AssignedVars[readerThread1of1ForFork0_i, readerThread1of1ForFork0_sum] 397#[L28-1, L67-1]don't care [2023-10-12 17:12:41,165 INFO L750 eck$LassoCheckResult]: Loop: 397#[L28-1, L67-1]don't care [118] L28-1-->L28-1: Formula: (and (<= 0 v_readerThread1of1ForFork0_i_28) (= (+ (select v_A_18 v_readerThread1of1ForFork0_i_28) v_readerThread1of1ForFork0_sum_20) v_readerThread1of1ForFork0_sum_19) (<= v_readerThread1of1ForFork0_i_28 v_N_18) (< v_readerThread1of1ForFork0_i_28 v_readerThread1of1ForFork0_end_11) (= v_readerThread1of1ForFork0_i_27 (+ v_readerThread1of1ForFork0_i_28 1))) InVars {A=v_A_18, N=v_N_18, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_28, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_20, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_11} OutVars{A=v_A_18, N=v_N_18, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_27, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_19, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_11} AuxVars[] AssignedVars[readerThread1of1ForFork0_i, readerThread1of1ForFork0_sum] 397#[L28-1, L67-1]don't care [2023-10-12 17:12:41,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:41,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1225306977, now seen corresponding path program 1 times [2023-10-12 17:12:41,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:41,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494187731] [2023-10-12 17:12:41,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:41,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:41,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:41,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:41,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:41,180 INFO L85 PathProgramCache]: Analyzing trace with hash 149, now seen corresponding path program 1 times [2023-10-12 17:12:41,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:41,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108610578] [2023-10-12 17:12:41,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:41,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:41,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:41,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:41,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash 670189495, now seen corresponding path program 1 times [2023-10-12 17:12:41,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:41,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405399017] [2023-10-12 17:12:41,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:41,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:41,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:41,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405399017] [2023-10-12 17:12:41,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405399017] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:41,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:41,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-10-12 17:12:41,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113487630] [2023-10-12 17:12:41,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:41,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:41,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-10-12 17:12:41,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-10-12 17:12:41,343 INFO L87 Difference]: Start difference. First operand 42 states and 99 transitions. cyclomatic complexity: 68 Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:41,430 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 [2023-10-12 17:12:41,445 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 [2023-10-12 17:12:41,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:41,474 INFO L93 Difference]: Finished difference Result 63 states and 139 transitions. [2023-10-12 17:12:41,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 139 transitions. [2023-10-12 17:12:41,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:12:41,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 49 states and 111 transitions. [2023-10-12 17:12:41,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-10-12 17:12:41,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2023-10-12 17:12:41,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 111 transitions. [2023-10-12 17:12:41,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:41,477 INFO L219 hiAutomatonCegarLoop]: Abstraction has 49 states and 111 transitions. [2023-10-12 17:12:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 111 transitions. [2023-10-12 17:12:41,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2023-10-12 17:12:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 42 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 96 transitions. [2023-10-12 17:12:41,479 INFO L241 hiAutomatonCegarLoop]: Abstraction has 43 states and 96 transitions. [2023-10-12 17:12:41,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-10-12 17:12:41,480 INFO L430 stractBuchiCegarLoop]: Abstraction has 43 states and 96 transitions. [2023-10-12 17:12:41,480 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:12:41,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 96 transitions. [2023-10-12 17:12:41,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:12:41,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:41,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:41,481 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:41,481 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:41,481 INFO L748 eck$LassoCheckResult]: Stem: 600#[$Ultimate##0]don't care [114] $Ultimate##0-->L59: Formula: (and (<= 0 v_ULTIMATE.start_min2_8) (<= v_ULTIMATE.start_max2_8 v_N_14) (<= 0 v_ULTIMATE.start_min1_6) (<= v_ULTIMATE.start_max1_6 v_N_14)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_14, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_14, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} AuxVars[] AssignedVars[] 560#[L59]don't care [95] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] 562#[L59-1, $Ultimate##0]don't care [98] L59-1-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_2 2) (= v_readerThread1of1ForFork2_start_4 v_ULTIMATE.start_min2_7) (= v_readerThread1of1ForFork2_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork2_thidvar0_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_16, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_2, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_2, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i, readerThread1of1ForFork2_thidvar0, readerThread1of1ForFork2_start, readerThread1of1ForFork2_thidvar1, readerThread1of1ForFork2_end] 570#[$Ultimate##0, $Ultimate##0, L60]don't care [82] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork1_start_1 v_writerThread1of1ForFork1_j_1) InVars {writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_1, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] 572#[$Ultimate##0, L60, L41-1]don't care [109] $Ultimate##0-->L28-1: Formula: (and (= v_readerThread1of1ForFork2_sum_17 0) (= v_readerThread1of1ForFork2_i_21 v_readerThread1of1ForFork2_start_5)) InVars {readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_5} OutVars{readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_17, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_21, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i] 546#[L28-1, L60, L41-1]don't care [120] L28-1-->L28-1: Formula: (and (<= v_readerThread1of1ForFork2_i_30 v_N_24) (= v_readerThread1of1ForFork2_sum_31 (+ (select v_A_28 v_readerThread1of1ForFork2_i_30) v_readerThread1of1ForFork2_sum_32)) (= v_readerThread1of1ForFork2_i_29 (+ v_readerThread1of1ForFork2_i_30 1)) (<= 0 v_readerThread1of1ForFork2_i_30) (< v_readerThread1of1ForFork2_i_30 v_readerThread1of1ForFork2_end_13)) InVars {A=v_A_28, N=v_N_24, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_32, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_30, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_13} OutVars{A=v_A_28, N=v_N_24, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_31, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_29, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_13} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i] 576#[L28-1, L60, L41-1]don't care [107] L28-1-->readerEXIT: Formula: (<= v_readerThread1of1ForFork2_end_7 v_readerThread1of1ForFork2_i_19) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_19, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_7} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_19, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_7} AuxVars[] AssignedVars[] 584#[readerEXIT, L60, L41-1]don't care [110] L41-1-->writerEXIT: Formula: (<= v_writerThread1of1ForFork1_end_7 v_writerThread1of1ForFork1_j_19) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_19, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_7} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_19, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_7} AuxVars[] AssignedVars[] 556#[readerEXIT, writerEXIT, L60]don't care [99] writerEXIT-->L61: Formula: (= v_writerThread1of1ForFork1_thidvar0_4 1) InVars {writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} OutVars{writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] 558#[L61, readerEXIT]don't care [100] readerEXIT-->L62: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_4 2) (= v_readerThread1of1ForFork2_thidvar0_4 2) (= v_readerThread1of1ForFork2_sum_10 v_ULTIMATE.start_sum_2)) InVars {readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} OutVars{ULTIMATE.start_sum=v_ULTIMATE.start_sum_2, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} AuxVars[] AssignedVars[ULTIMATE.start_sum] 568#[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[] 540#[L67]don't care [92] L67-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_2 2) (= v_readerThread1of1ForFork0_thidvar1_2 2) (= v_readerThread1of1ForFork0_start_4 v_ULTIMATE.start_min2_5) (= v_readerThread1of1ForFork0_end_6 v_ULTIMATE.start_max2_5)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_4, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_8, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_16, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork0_start, readerThread1of1ForFork0_sum, readerThread1of1ForFork0_i, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_end] 542#[$Ultimate##0, L67-1]don't care [113] $Ultimate##0-->L28-1: Formula: (and (= v_readerThread1of1ForFork0_i_25 v_readerThread1of1ForFork0_start_5) (= v_readerThread1of1ForFork0_sum_17 0)) InVars {readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5} OutVars{readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_25, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_17} AuxVars[] AssignedVars[readerThread1of1ForFork0_i, readerThread1of1ForFork0_sum] 564#[L28-1, L67-1]don't care [2023-10-12 17:12:41,481 INFO L750 eck$LassoCheckResult]: Loop: 564#[L28-1, L67-1]don't care [118] L28-1-->L28-1: Formula: (and (<= 0 v_readerThread1of1ForFork0_i_28) (= (+ (select v_A_18 v_readerThread1of1ForFork0_i_28) v_readerThread1of1ForFork0_sum_20) v_readerThread1of1ForFork0_sum_19) (<= v_readerThread1of1ForFork0_i_28 v_N_18) (< v_readerThread1of1ForFork0_i_28 v_readerThread1of1ForFork0_end_11) (= v_readerThread1of1ForFork0_i_27 (+ v_readerThread1of1ForFork0_i_28 1))) InVars {A=v_A_18, N=v_N_18, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_28, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_20, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_11} OutVars{A=v_A_18, N=v_N_18, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_27, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_19, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_11} AuxVars[] AssignedVars[readerThread1of1ForFork0_i, readerThread1of1ForFork0_sum] 564#[L28-1, L67-1]don't care [2023-10-12 17:12:41,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:41,482 INFO L85 PathProgramCache]: Analyzing trace with hash -495495131, now seen corresponding path program 1 times [2023-10-12 17:12:41,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:41,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806927003] [2023-10-12 17:12:41,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:41,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:41,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:41,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:41,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:41,498 INFO L85 PathProgramCache]: Analyzing trace with hash 149, now seen corresponding path program 2 times [2023-10-12 17:12:41,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:41,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486065604] [2023-10-12 17:12:41,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:41,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:41,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:41,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:41,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:41,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1819520241, now seen corresponding path program 1 times [2023-10-12 17:12:41,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:41,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998173974] [2023-10-12 17:12:41,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:41,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:41,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:41,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:41,781 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:41,781 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:41,781 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:41,781 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:41,781 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:41,781 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:41,781 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:41,781 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:41,781 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:12:41,782 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:41,782 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:41,785 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:41,787 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:41,789 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:41,790 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:41,793 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:41,794 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:42,019 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:42,019 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:42,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:42,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:42,020 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) [2023-10-12 17:12:42,035 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 [2023-10-12 17:12:42,036 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 [2023-10-12 17:12:42,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:42,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:42,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:42,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:42,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:42,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:42,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:42,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:42,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:42,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:42,056 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) [2023-10-12 17:12:42,057 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 [2023-10-12 17:12:42,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:12:42,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:42,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:42,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:42,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:42,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:42,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:42,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:42,082 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 [2023-10-12 17:12:42,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:42,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:42,173 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) [2023-10-12 17:12:42,174 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 [2023-10-12 17:12:42,176 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 [2023-10-12 17:12:42,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:42,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:42,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:42,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:42,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:42,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:42,193 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:42,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-10-12 17:12:42,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:42,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:42,198 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:42,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:12:42,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:12:42,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:42,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:42,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:42,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:42,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:42,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:42,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:42,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:42,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:42,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:42,269 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:42,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:12:42,274 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 [2023-10-12 17:12:42,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:42,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:42,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:42,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:42,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:42,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:42,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:42,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:42,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:42,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:42,303 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:42,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:12:42,306 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 [2023-10-12 17:12:42,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:42,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:42,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:42,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:42,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:42,319 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:42,341 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:42,353 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:12:42,353 INFO L444 ModelExtractionUtils]: 35 out of 46 variables were initially zero. Simplification set additionally 8 variables to zero. [2023-10-12 17:12:42,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:42,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:42,356 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:42,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:12:42,359 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:42,370 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:12:42,370 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:42,370 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(readerThread1of1ForFork0_i, readerThread1of1ForFork0_end) = -1*readerThread1of1ForFork0_i + 1*readerThread1of1ForFork0_end Supporting invariants [] [2023-10-12 17:12:42,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:42,382 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:42,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:42,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:42,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:42,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:42,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:42,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:42,414 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:12:42,415 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 96 transitions. cyclomatic complexity: 64 Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:42,427 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 96 transitions. cyclomatic complexity: 64. Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 44 states and 97 transitions. Complement of second has 2 states. [2023-10-12 17:12:42,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 15 transitions. [2023-10-12 17:12:42,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 13 letters. Loop has 1 letters. [2023-10-12 17:12:42,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:42,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 14 letters. Loop has 1 letters. [2023-10-12 17:12:42,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:42,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 13 letters. Loop has 2 letters. [2023-10-12 17:12:42,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:42,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 97 transitions. [2023-10-12 17:12:42,433 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:12:42,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2023-10-12 17:12:42,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:12:42,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:12:42,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:12:42,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:12:42,433 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:12:42,434 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:12:42,434 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:12:42,434 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:12:42,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:12:42,434 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:12:42,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:12:42,438 INFO L201 PluginConnector]: Adding new model optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:12:42 BoogieIcfgContainer [2023-10-12 17:12:42,438 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:12:42,439 INFO L158 Benchmark]: Toolchain (without parser) took 3686.15ms. Allocated memory was 225.4MB in the beginning and 270.5MB in the end (delta: 45.1MB). Free memory was 173.2MB in the beginning and 137.3MB in the end (delta: 35.9MB). Peak memory consumption was 83.6MB. Max. memory is 8.0GB. [2023-10-12 17:12:42,440 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 225.4MB. Free memory was 174.4MB in the beginning and 174.3MB in the end (delta: 79.7kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:12:42,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.71ms. Allocated memory is still 225.4MB. Free memory was 173.1MB in the beginning and 171.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:42,445 INFO L158 Benchmark]: Boogie Preprocessor took 19.11ms. Allocated memory is still 225.4MB. Free memory was 171.5MB in the beginning and 170.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:42,445 INFO L158 Benchmark]: RCFGBuilder took 187.90ms. Allocated memory is still 225.4MB. Free memory was 170.5MB in the beginning and 192.3MB in the end (delta: -21.7MB). Peak memory consumption was 16.9MB. Max. memory is 8.0GB. [2023-10-12 17:12:42,446 INFO L158 Benchmark]: BuchiAutomizer took 3451.16ms. Allocated memory was 225.4MB in the beginning and 270.5MB in the end (delta: 45.1MB). Free memory was 192.1MB in the beginning and 137.3MB in the end (delta: 54.8MB). Peak memory consumption was 100.3MB. Max. memory is 8.0GB. [2023-10-12 17:12:42,448 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.24ms. Allocated memory is still 225.4MB. Free memory was 174.4MB in the beginning and 174.3MB in the end (delta: 79.7kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.71ms. Allocated memory is still 225.4MB. Free memory was 173.1MB in the beginning and 171.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.11ms. Allocated memory is still 225.4MB. Free memory was 171.5MB in the beginning and 170.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 187.90ms. Allocated memory is still 225.4MB. Free memory was 170.5MB in the beginning and 192.3MB in the end (delta: -21.7MB). Peak memory consumption was 16.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 3451.16ms. Allocated memory was 225.4MB in the beginning and 270.5MB in the end (delta: 45.1MB). Free memory was 192.1MB in the beginning and 137.3MB in the end (delta: 54.8MB). Peak memory consumption was 100.3MB. 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 3 locations. One deterministic module has affine ranking function end + -1 * i and consists of 3 locations. One deterministic module has affine ranking function end + -1 * i and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 12 mSDtfsCounter, 179 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 lsp82 ukn93 mio100 lsp87 div100 bol100 ite100 ukn100 eq159 hnf91 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 76ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 41 PlacesBefore, 26 PlacesAfterwards, 35 TransitionsBefore, 20 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 3 FixpointIterations, 6 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 17 TotalNumberOfCompositions, 143 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 134, independent: 132, independent conditional: 0, independent unconditional: 132, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 89, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 89, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 134, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 89, unknown conditional: 0, unknown unconditional: 89] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:12:42,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-10-12 17:12:42,670 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...