/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:53:55,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:53:56,054 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-09 23:53:56,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:53:56,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:53:56,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:53:56,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:53:56,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:53:56,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:53:56,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:53:56,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:53:56,099 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:53:56,099 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:53:56,100 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:53:56,100 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:53:56,100 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:53:56,100 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:53:56,101 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:53:56,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:53:56,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:53:56,101 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:53:56,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:53:56,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:53:56,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:53:56,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:53:56,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:53:56,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:53:56,103 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:53:56,103 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:53:56,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:53:56,104 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:53:56,105 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:53:56,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:53:56,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:53:56,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:53:56,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:53:56,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:53:56,106 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:53:56,106 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2024-02-09 23:53:56,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:53:56,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:53:56,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:53:56,408 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-09 23:53:56,409 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-09 23:53:56,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency1.bpl [2024-02-09 23:53:56,411 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency1.bpl' [2024-02-09 23:53:56,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:53:56,445 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-09 23:53:56,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:53:56,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:53:56,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:53:56,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,467 INFO L138 Inliner]: procedures = 3, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-09 23:53:56,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:53:56,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:53:56,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:53:56,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:53:56,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,496 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:53:56,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:53:56,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:53:56,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:53:56,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:56,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:56,558 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:53:56,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-09 23:53:56,596 INFO L124 BoogieDeclarations]: Specification and implementation of procedure reader given in one single declaration [2024-02-09 23:53:56,596 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-02-09 23:53:56,596 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-02-09 23:53:56,597 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-09 23:53:56,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:53:56,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:53:56,597 INFO L124 BoogieDeclarations]: Specification and implementation of procedure writer given in one single declaration [2024-02-09 23:53:56,597 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-02-09 23:53:56,597 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-02-09 23:53:56,598 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-09 23:53:56,643 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:53:56,645 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:53:56,765 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:53:56,770 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:53:56,770 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-09 23:53:56,772 INFO L201 PluginConnector]: Adding new model optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:53:56 BoogieIcfgContainer [2024-02-09 23:53:56,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:53:56,772 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:53:56,773 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:53:56,775 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:53:56,776 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:53:56,776 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/2) ... [2024-02-09 23:53:56,777 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30300344 and model type optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:53:56, skipping insertion in model container [2024-02-09 23:53:56,777 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:53:56,777 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:53:56" (2/2) ... [2024-02-09 23:53:56,778 INFO L332 chiAutomizerObserver]: Analyzing ICFG optimistic-concurrency1.bpl [2024-02-09 23:53:56,837 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-02-09 23:53:56,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 44 transitions, 115 flow [2024-02-09 23:53:56,874 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2024-02-09 23:53:56,874 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-09 23:53:56,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 4/36 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-02-09 23:53:56,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 44 transitions, 115 flow [2024-02-09 23:53:56,881 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 36 transitions, 90 flow [2024-02-09 23:53:56,885 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:53:56,885 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:53:56,885 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:53:56,886 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:53:56,886 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:53:56,886 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:53:56,886 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:53:56,886 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-09 23:53:56,886 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 places, 36 transitions, 90 flow [2024-02-09 23:53:56,892 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:53:56,892 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2024-02-09 23:53:56,892 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-09 23:53:56,892 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:53:56,894 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:53:56,894 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 places, 36 transitions, 90 flow [2024-02-09 23:53:56,898 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:53:56,898 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2024-02-09 23:53:56,898 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-09 23:53:56,898 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:53:56,902 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_3) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] 51#[L56]true [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_4) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] 53#[L59]true [99] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork2_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork2_thidvar0_2 1) (= v_writerThread1of1ForFork2_start_4 v_ULTIMATE.start_min1_5)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_16, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_6, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_4, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork2_j, writerThread1of1ForFork2_end, writerThread1of1ForFork2_start, writerThread1of1ForFork2_thidvar0] 55#[L59-1, $Ultimate##0]true [84] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork2_j_1 v_writerThread1of1ForFork2_start_1) InVars {writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_1, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork2_j] 57#[L41-1, L59-1]true [2024-02-09 23:53:56,903 INFO L750 eck$LassoCheckResult]: Loop: 57#[L41-1, L59-1]true [86] L41-1-->L42: Formula: (< v_writerThread1of1ForFork2_j_5 v_writerThread1of1ForFork2_end_3) InVars {writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_3, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_5} OutVars{writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_3, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_5} AuxVars[] AssignedVars[] 60#[L59-1, L42]true [88] L42-->L43: Formula: (and (<= 0 v_writerThread1of1ForFork2_j_7) (<= v_writerThread1of1ForFork2_j_7 v_N_5)) InVars {writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_7, N=v_N_5} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_7, N=v_N_5} AuxVars[] AssignedVars[] 62#[L59-1, L43]true [89] L43-->L44: Formula: (= (store v_A_3 v_writerThread1of1ForFork2_j_9 0) v_A_2) InVars {A=v_A_3, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_9} OutVars{A=v_A_2, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_9} AuxVars[] AssignedVars[A] 64#[L59-1, L44]true [90] L44-->L41-1: Formula: (= v_writerThread1of1ForFork2_j_12 (+ v_writerThread1of1ForFork2_j_11 1)) InVars {writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_11} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_12} AuxVars[] AssignedVars[writerThread1of1ForFork2_j] 57#[L41-1, L59-1]true [2024-02-09 23:53:56,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:56,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2842908, now seen corresponding path program 1 times [2024-02-09 23:53:56,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:56,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250624436] [2024-02-09 23:53:56,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:56,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:56,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:56,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:56,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:56,995 INFO L85 PathProgramCache]: Analyzing trace with hash 3572964, now seen corresponding path program 1 times [2024-02-09 23:53:56,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:56,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927750518] [2024-02-09 23:53:56,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:56,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:57,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:57,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:57,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:57,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1262870655, now seen corresponding path program 1 times [2024-02-09 23:53:57,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:57,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236212438] [2024-02-09 23:53:57,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:57,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:57,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:57,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:57,219 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:53:57,220 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:53:57,220 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:53:57,220 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:53:57,220 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:53:57,220 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:57,222 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:53:57,222 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:53:57,222 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency1.bpl_BEv2_Iteration1_Lasso [2024-02-09 23:53:57,222 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:53:57,222 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:53:57,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:53:57,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:53:57,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:53:57,322 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:53:57,325 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:53:57,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:57,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:57,331 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:53:57,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-09 23:53:57,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:53:57,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:57,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:57,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:53:57,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:57,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:53:57,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:53:57,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:53:57,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-09 23:53:57,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:57,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:57,413 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:53:57,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-09 23:53:57,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:53:57,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:57,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:57,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:53:57,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:57,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:53:57,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:53:57,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:53:57,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-09 23:53:57,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:57,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:57,465 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:53:57,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-09 23:53:57,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:53:57,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:57,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:53:57,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:57,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:53:57,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:57,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:53:57,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:53:57,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:53:57,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-09 23:53:57,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:57,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:57,490 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:53:57,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:53:57,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-09 23:53:57,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:57,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:57,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:53:57,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:57,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:53:57,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:53:57,558 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:53:57,588 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-09 23:53:57,588 INFO L444 ModelExtractionUtils]: 8 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-02-09 23:53:57,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:57,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:57,593 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:53:57,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-09 23:53:57,595 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:53:57,621 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:53:57,621 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:53:57,622 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(writerThread1of1ForFork2_j, writerThread1of1ForFork2_end) = -1*writerThread1of1ForFork2_j + 1*writerThread1of1ForFork2_end Supporting invariants [] [2024-02-09 23:53:57,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-09 23:53:57,629 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:53:57,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:53:57,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:53:57,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:53:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:53:57,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:53:57,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:53:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:53:57,748 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-09 23:53:57,751 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:53:57,896 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 556 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:53:57,897 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:53:57,897 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:53:57,904 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:53:57,904 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:53:57,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 23:53:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:53:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2024-02-09 23:53:57,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 214 transitions. Stem has 4 letters. Loop has 4 letters. [2024-02-09 23:53:57,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:53:57,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 214 transitions. Stem has 8 letters. Loop has 4 letters. [2024-02-09 23:53:57,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:53:57,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 214 transitions. Stem has 4 letters. Loop has 8 letters. [2024-02-09 23:53:57,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:53:57,916 INFO L428 stractBuchiCegarLoop]: Abstraction has has 60 places, 904 transitions, 4054 flow [2024-02-09 23:53:57,916 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:53:57,916 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 60 places, 904 transitions, 4054 flow [2024-02-09 23:53:57,962 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:53:57,962 INFO L124 PetriNetUnfolderBase]: 186/312 cut-off events. [2024-02-09 23:53:57,963 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-02-09 23:53:57,963 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:53:57,963 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_3) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] 51#[L56]true [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_4) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] 53#[L59]true [99] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork2_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork2_thidvar0_2 1) (= v_writerThread1of1ForFork2_start_4 v_ULTIMATE.start_min1_5)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_16, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_6, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_4, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork2_j, writerThread1of1ForFork2_end, writerThread1of1ForFork2_start, writerThread1of1ForFork2_thidvar0] 55#[L59-1, $Ultimate##0]true [93] L59-1-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_2 2) (= v_readerThread1of1ForFork0_thidvar1_2 2) (= v_readerThread1of1ForFork0_start_4 v_ULTIMATE.start_min2_5) (= v_readerThread1of1ForFork0_end_6 v_ULTIMATE.start_max2_5)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_4, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_8, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_18, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork0_start, readerThread1of1ForFork0_sum, readerThread1of1ForFork0_i, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_end] 139#[$Ultimate##0, L60, $Ultimate##0]true [66] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork0_sum_1 0) InVars {} OutVars{readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum] 141#[L27, L60, $Ultimate##0]true [67] L27-->L28-1: Formula: (= v_readerThread1of1ForFork0_start_1 v_readerThread1of1ForFork0_i_1) InVars {readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_1, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_i] 143#[L60, $Ultimate##0, L28-1]true [69] L28-1-->L29: Formula: (< v_readerThread1of1ForFork0_i_5 v_readerThread1of1ForFork0_end_3) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} AuxVars[] AssignedVars[] 145#[L60, $Ultimate##0, L29]true [72] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork0_i_9 v_N_2) (<= 0 v_readerThread1of1ForFork0_i_9)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} AuxVars[] AssignedVars[] 147#[L60, $Ultimate##0, L30]true [73] L30-->L31: Formula: (= (+ v_readerThread1of1ForFork0_sum_3 (select v_A_1 v_readerThread1of1ForFork0_i_11)) v_readerThread1of1ForFork0_sum_4) InVars {A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum] 149#[L60, $Ultimate##0, L31]true [74] L31-->L28-1: Formula: (= v_readerThread1of1ForFork0_i_14 (+ v_readerThread1of1ForFork0_i_13 1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_13} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_14} AuxVars[] AssignedVars[readerThread1of1ForFork0_i] 143#[L60, $Ultimate##0, L28-1]true [2024-02-09 23:53:57,964 INFO L750 eck$LassoCheckResult]: Loop: 143#[L60, $Ultimate##0, L28-1]true [69] L28-1-->L29: Formula: (< v_readerThread1of1ForFork0_i_5 v_readerThread1of1ForFork0_end_3) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} AuxVars[] AssignedVars[] 145#[L60, $Ultimate##0, L29]true [72] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork0_i_9 v_N_2) (<= 0 v_readerThread1of1ForFork0_i_9)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} AuxVars[] AssignedVars[] 147#[L60, $Ultimate##0, L30]true [73] L30-->L31: Formula: (= (+ v_readerThread1of1ForFork0_sum_3 (select v_A_1 v_readerThread1of1ForFork0_i_11)) v_readerThread1of1ForFork0_sum_4) InVars {A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum] 149#[L60, $Ultimate##0, L31]true [74] L31-->L28-1: Formula: (= v_readerThread1of1ForFork0_i_14 (+ v_readerThread1of1ForFork0_i_13 1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_13} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_14} AuxVars[] AssignedVars[readerThread1of1ForFork0_i] 143#[L60, $Ultimate##0, L28-1]true [2024-02-09 23:53:57,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:57,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1242932778, now seen corresponding path program 1 times [2024-02-09 23:53:57,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:57,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006199554] [2024-02-09 23:53:57,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:57,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:57,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:57,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:57,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:57,981 INFO L85 PathProgramCache]: Analyzing trace with hash 3050629, now seen corresponding path program 1 times [2024-02-09 23:53:57,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:57,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118018745] [2024-02-09 23:53:57,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:57,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:57,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:57,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:57,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:57,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1564669486, now seen corresponding path program 2 times [2024-02-09 23:53:57,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:57,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74761843] [2024-02-09 23:53:57,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:57,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:57,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:58,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:58,151 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:53:58,152 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:53:58,152 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:53:58,152 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:53:58,152 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:53:58,152 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:58,152 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:53:58,152 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:53:58,152 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency1.bpl_BEv2_Iteration2_Lasso [2024-02-09 23:53:58,152 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:53:58,152 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:53:58,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:53:58,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:53:58,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:53:58,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:53:58,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:53:58,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:53:58,287 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:53:58,287 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:53:58,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:58,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:58,289 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:53:58,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:53:58,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:58,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:58,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:53:58,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:58,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:53:58,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:53:58,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-09 23:53:58,320 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:53:58,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-02-09 23:53:58,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:58,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:58,325 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:53:58,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:53:58,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:58,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:58,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:53:58,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:58,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:53:58,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:53:58,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-09 23:53:58,379 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:53:58,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-09 23:53:58,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:58,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:58,395 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:53:58,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:53:58,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-09 23:53:58,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:58,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:58,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:53:58,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:58,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:53:58,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:53:58,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:53:58,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-09 23:53:58,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:58,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:58,440 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:53:58,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:53:58,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:58,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:58,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:53:58,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:58,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-09 23:53:58,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:53:58,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:53:58,468 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:53:58,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-02-09 23:53:58,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:58,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:58,505 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:53:58,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:53:58,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:58,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:58,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:53:58,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:58,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:53:58,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:53:58,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-09 23:53:58,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:53:58,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-09 23:53:58,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:58,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:58,558 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:53:58,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:53:58,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:58,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:58,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:53:58,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:58,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:53:58,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:53:58,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-09 23:53:58,604 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:53:58,614 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-02-09 23:53:58,614 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-02-09 23:53:58,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:58,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:58,624 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:53:58,627 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:53:58,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-09 23:53:58,645 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:53:58,645 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:53:58,645 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, readerThread1of1ForFork0_i) = 2*N - 2*readerThread1of1ForFork0_i + 1 Supporting invariants [] [2024-02-09 23:53:58,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-02-09 23:53:58,655 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:53:58,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:53:58,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:53:58,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:53:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:53:58,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:53:58,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:53:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:53:58,705 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-09 23:53:58,705 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) [2024-02-09 23:53:58,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-02-09 23:53:58,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-09 23:53:58,819 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 8 states and 514 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:53:58,819 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:53:58,819 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:53:58,909 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:53:58,909 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:53:58,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 23:53:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) [2024-02-09 23:53:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2024-02-09 23:53:58,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 10 letters. Loop has 4 letters. [2024-02-09 23:53:58,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:53:58,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 14 letters. Loop has 4 letters. [2024-02-09 23:53:58,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:53:58,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 10 letters. Loop has 8 letters. [2024-02-09 23:53:58,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:53:58,913 INFO L428 stractBuchiCegarLoop]: Abstraction has has 76 places, 20968 transitions, 135540 flow [2024-02-09 23:53:58,914 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:53:58,914 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 76 places, 20968 transitions, 135540 flow [2024-02-09 23:54:00,341 INFO L124 PetriNetUnfolderBase]: 2660/3964 cut-off events. [2024-02-09 23:54:00,341 INFO L125 PetriNetUnfolderBase]: For 215/215 co-relation queries the response was YES. [2024-02-09 23:54:00,341 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2024-02-09 23:54:00,347 INFO L201 PluginConnector]: Adding new model optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:54:00 BoogieIcfgContainer [2024-02-09 23:54:00,347 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:54:00,347 INFO L158 Benchmark]: Toolchain (without parser) took 3902.21ms. Allocated memory was 177.2MB in the beginning and 342.9MB in the end (delta: 165.7MB). Free memory was 151.5MB in the beginning and 183.0MB in the end (delta: -31.4MB). Peak memory consumption was 188.2MB. Max. memory is 8.0GB. [2024-02-09 23:54:00,348 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 177.2MB. Free memory was 152.7MB in the beginning and 152.6MB in the end (delta: 83.8kB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:54:00,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.94ms. Allocated memory is still 177.2MB. Free memory was 151.5MB in the beginning and 149.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-09 23:54:00,348 INFO L158 Benchmark]: Boogie Preprocessor took 36.74ms. Allocated memory is still 177.2MB. Free memory was 149.9MB in the beginning and 156.6MB in the end (delta: -6.7MB). Peak memory consumption was 3.8MB. Max. memory is 8.0GB. [2024-02-09 23:54:00,349 INFO L158 Benchmark]: RCFGBuilder took 265.13ms. Allocated memory is still 177.2MB. Free memory was 156.6MB in the beginning and 146.6MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-09 23:54:00,349 INFO L158 Benchmark]: BuchiAutomizer took 3574.50ms. Allocated memory was 177.2MB in the beginning and 342.9MB in the end (delta: 165.7MB). Free memory was 146.5MB in the beginning and 183.0MB in the end (delta: -36.4MB). Peak memory consumption was 184.4MB. Max. memory is 8.0GB. [2024-02-09 23:54:00,350 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.10ms. Allocated memory is still 177.2MB. Free memory was 152.7MB in the beginning and 152.6MB in the end (delta: 83.8kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.94ms. Allocated memory is still 177.2MB. Free memory was 151.5MB in the beginning and 149.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.74ms. Allocated memory is still 177.2MB. Free memory was 149.9MB in the beginning and 156.6MB in the end (delta: -6.7MB). Peak memory consumption was 3.8MB. Max. memory is 8.0GB. * RCFGBuilder took 265.13ms. Allocated memory is still 177.2MB. Free memory was 156.6MB in the beginning and 146.6MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3574.50ms. Allocated memory was 177.2MB in the beginning and 342.9MB in the end (delta: 165.7MB). Free memory was 146.5MB in the beginning and 183.0MB in the end (delta: -36.4MB). Peak memory consumption was 184.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function end + -1 * j and consists of 5 locations. One deterministic module has affine ranking function 2 * N + -2 * i + 1 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 246 mSDsluCounter, 346 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 184 IncrementalHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 184 mSDtfsCounter, 184 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital60 mio100 ax100 hnf100 lsp83 ukn90 mio100 lsp89 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 78ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-02-09 23:54:00,379 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...