/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 RABIN_PETRI_NET -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:37:17,065 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:37:17,132 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:37:17,165 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:37:17,165 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:37:17,166 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:37:17,168 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:37:17,168 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:37:17,169 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:37:17,173 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:37:17,173 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:37:17,173 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:37:17,173 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:37:17,175 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:37:17,175 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:37:17,175 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:37:17,176 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:37:17,176 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:37:17,176 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:37:17,177 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:37:17,177 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:37:17,177 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:37:17,177 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:37:17,178 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:37:17,178 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:37:17,178 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:37:17,178 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:37:17,178 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:37:17,179 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:37:17,179 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:37:17,180 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:37:17,180 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:37:17,180 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:37:17,182 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:37:17,182 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 -> RABIN_PETRI_NET [2023-10-12 17:37:17,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:37:17,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:37:17,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:37:17,415 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:37:17,416 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:37:17,417 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:37:17,417 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency2.bpl' [2023-10-12 17:37:17,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:37:17,454 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:37:17,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:17,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:37:17,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:37:17,468 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:37:17" (1/1) ... [2023-10-12 17:37:17,477 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:37:17" (1/1) ... [2023-10-12 17:37:17,482 INFO L138 Inliner]: procedures = 3, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:37:17,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:17,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:37:17,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:37:17,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:37:17,492 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:37:17" (1/1) ... [2023-10-12 17:37:17,493 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:37:17" (1/1) ... [2023-10-12 17:37:17,494 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:37:17" (1/1) ... [2023-10-12 17:37:17,494 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:37:17" (1/1) ... [2023-10-12 17:37:17,497 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:37:17" (1/1) ... [2023-10-12 17:37:17,500 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:37:17" (1/1) ... [2023-10-12 17:37:17,501 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:37:17" (1/1) ... [2023-10-12 17:37:17,501 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:37:17" (1/1) ... [2023-10-12 17:37:17,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:37:17,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:37:17,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:37:17,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:37:17,508 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:37:17" (1/1) ... [2023-10-12 17:37:17,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:17,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:17,542 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:37:17,553 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:37:17,580 INFO L124 BoogieDeclarations]: Specification and implementation of procedure reader given in one single declaration [2023-10-12 17:37:17,580 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2023-10-12 17:37:17,580 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2023-10-12 17:37:17,581 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:37:17,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:37:17,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:37:17,581 INFO L124 BoogieDeclarations]: Specification and implementation of procedure writer given in one single declaration [2023-10-12 17:37:17,581 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2023-10-12 17:37:17,582 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2023-10-12 17:37:17,582 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:37:17,632 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:37:17,633 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:37:17,731 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:37:17,737 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:37:17,737 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:37:17,739 INFO L201 PluginConnector]: Adding new model optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:17 BoogieIcfgContainer [2023-10-12 17:37:17,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:37:17,740 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:37:17,740 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:37:17,752 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:37:17,753 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:17,753 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:37:17" (1/2) ... [2023-10-12 17:37:17,757 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1297180c and model type optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:37:17, skipping insertion in model container [2023-10-12 17:37:17,757 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:17,757 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:37:17" (2/2) ... [2023-10-12 17:37:17,758 INFO L332 chiAutomizerObserver]: Analyzing ICFG optimistic-concurrency2.bpl [2023-10-12 17:37:17,850 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2023-10-12 17:37:17,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 116 flow [2023-10-12 17:37:17,895 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2023-10-12 17:37:17,895 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:37:17,899 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:37:17,899 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 43 transitions, 116 flow [2023-10-12 17:37:17,903 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 88 flow [2023-10-12 17:37:17,906 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:37:17,918 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 35 transitions, 88 flow [2023-10-12 17:37:17,920 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 35 transitions, 88 flow [2023-10-12 17:37:17,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 88 flow [2023-10-12 17:37:17,929 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2023-10-12 17:37:17,929 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:37:17,930 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:37:17,931 INFO L119 LiptonReduction]: Number of co-enabled transitions 160 [2023-10-12 17:37:18,343 INFO L134 LiptonReduction]: Checked pairs total: 143 [2023-10-12 17:37:18,343 INFO L136 LiptonReduction]: Total number of compositions: 17 [2023-10-12 17:37:18,359 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:37:18,359 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:37:18,359 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:37:18,359 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:37:18,359 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:37:18,359 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:37:18,360 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:37:18,360 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:37:18,360 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 20 transitions, 58 flow [2023-10-12 17:37:18,364 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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[][16], 2:2A:[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][0], 4:3A:[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][7]][5:4A:[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][17]] [2023-10-12 17:37:18,370 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:18,370 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:37:18,370 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:18,370 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:18,373 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:37:18,375 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 20 transitions, 58 flow [2023-10-12 17:37:18,377 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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[][16], 2:2A:[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][0], 4:3A:[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][7]][5:4A:[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][17]] [2023-10-12 17:37:18,377 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:18,377 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:37:18,377 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:18,377 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:18,381 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [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]true [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]true [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] 54#[L59-1, L41-1]true [2023-10-12 17:37:18,382 INFO L750 eck$LassoCheckResult]: Loop: 54#[L59-1, L41-1]true [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] 54#[L59-1, L41-1]true [2023-10-12 17:37:18,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:18,391 INFO L85 PathProgramCache]: Analyzing trace with hash 142372, now seen corresponding path program 1 times [2023-10-12 17:37:18,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:18,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079612868] [2023-10-12 17:37:18,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:18,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:18,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:18,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:18,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:18,529 INFO L85 PathProgramCache]: Analyzing trace with hash 150, now seen corresponding path program 1 times [2023-10-12 17:37:18,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:18,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716832724] [2023-10-12 17:37:18,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:18,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:18,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:18,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:18,547 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:18,547 INFO L85 PathProgramCache]: Analyzing trace with hash 4413651, now seen corresponding path program 1 times [2023-10-12 17:37:18,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:18,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407165189] [2023-10-12 17:37:18,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:18,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:18,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:18,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:18,659 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:18,660 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:18,660 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:18,660 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:18,660 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:18,660 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:18,660 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:18,660 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:18,661 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:37:18,661 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:18,661 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:18,674 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:37:18,704 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:37:18,707 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:37:18,779 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:18,782 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:18,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:18,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:18,789 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:37:18,798 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:37:18,801 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:37:18,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:18,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:18,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:18,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:18,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:18,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:18,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:18,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:18,833 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 [2023-10-12 17:37:18,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:18,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:18,997 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:37:18,998 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:37:19,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:19,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:19,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:19,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:19,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:19,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:19,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:19,046 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:19,086 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2023-10-12 17:37:19,086 INFO L444 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 15 variables to zero. [2023-10-12 17:37:19,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:19,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:19,103 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:37:19,105 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:37:19,106 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:19,127 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:19,128 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:19,128 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:37:19,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:37:19,136 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:19,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:19,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:19,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:19,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:19,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:19,190 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:37:19,219 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:37:19,313 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:37:19,317 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:37:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2023-10-12 17:37:19,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 176 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:19,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:19,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 176 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:19,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:19,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 176 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:37:19,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:19,327 INFO L430 stractBuchiCegarLoop]: Abstraction has has 30 places, 80 transitions, 392 flow [2023-10-12 17:37:19,327 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:37:19,328 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 30 places, 80 transitions, 392 flow [2023-10-12 17:37:19,334 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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[][66], 2:2A:[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][2], 3:3A:[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][6], 13:4A:[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][46]][14:5A:[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][78]] [2023-10-12 17:37:19,335 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:19,335 INFO L124 PetriNetUnfolderBase]: 6/13 cut-off events. [2023-10-12 17:37:19,335 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:37:19,335 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:19,336 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [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]true [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]true [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] 94#[L60, $Ultimate##0, $Ultimate##0]true [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] 96#[L28-1, L60, $Ultimate##0]true [2023-10-12 17:37:19,336 INFO L750 eck$LassoCheckResult]: Loop: 96#[L28-1, L60, $Ultimate##0]true [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] 96#[L28-1, L60, $Ultimate##0]true [2023-10-12 17:37:19,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:19,338 INFO L85 PathProgramCache]: Analyzing trace with hash 4414137, now seen corresponding path program 1 times [2023-10-12 17:37:19,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:19,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105324965] [2023-10-12 17:37:19,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:19,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:19,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:19,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:19,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:19,367 INFO L85 PathProgramCache]: Analyzing trace with hash 151, now seen corresponding path program 1 times [2023-10-12 17:37:19,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:19,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208331344] [2023-10-12 17:37:19,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:19,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:19,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:19,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:19,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:19,376 INFO L85 PathProgramCache]: Analyzing trace with hash 136838367, now seen corresponding path program 1 times [2023-10-12 17:37:19,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:19,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569332151] [2023-10-12 17:37:19,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:19,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:19,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:19,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:19,523 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:19,524 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:19,524 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:19,524 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:19,524 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:19,524 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:19,524 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:19,524 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:19,524 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:37:19,524 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:19,524 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:19,527 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:37:19,529 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:37:19,534 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:37:19,536 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:37:19,539 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:37:19,569 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:37:19,680 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:19,680 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:19,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:19,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:19,685 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:37:19,688 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:37:19,689 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:37:19,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:19,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:19,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:19,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:19,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:19,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:19,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:19,726 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:37:19,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:19,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:19,729 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:37:19,731 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:37:19,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:19,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:19,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:19,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:19,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:19,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:19,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:19,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:19,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:37:19,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:19,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:19,755 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:37:19,757 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:37:19,758 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:37:19,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:19,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:19,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:19,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:19,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:19,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:19,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:19,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:19,785 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:37:19,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:19,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:19,787 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:37:19,795 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:37:19,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:19,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:19,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:19,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:19,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:19,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:19,818 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:37:19,830 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:37:19,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:19,836 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:37:19,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:19,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:19,838 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:37:19,841 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:37:19,842 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:37:19,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:19,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:19,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:19,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:19,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:19,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:19,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:19,872 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:37:19,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:19,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:19,873 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:37:19,882 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:37:19,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:19,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:19,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:19,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:19,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:19,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:19,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:19,912 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:19,951 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:37:19,951 INFO L444 ModelExtractionUtils]: 9 out of 28 variables were initially zero. Simplification set additionally 16 variables to zero. [2023-10-12 17:37:19,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:19,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:19,956 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:19,958 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:37:20,006 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:20,021 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:20,021 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:20,022 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:37:20,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:37:20,029 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:20,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:20,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:20,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:20,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:20,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:20,061 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:37:20,061 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:37:20,152 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:37:20,153 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:37:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2023-10-12 17:37:20,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 174 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:20,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:20,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 174 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:20,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:20,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 174 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:37:20,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:20,155 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 320 transitions, 2208 flow [2023-10-12 17:37:20,155 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:37:20,155 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 320 transitions, 2208 flow [2023-10-12 17:37:20,167 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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[][265], 2:2A:[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][9], 4:3A:[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][121], 6:4A:[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][17], 19:5A:[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[][149], 34:6A:[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][181], 51:7A:[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[][100], 59:8A:[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[][215], 60:9A:[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][39], 61:10A:[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[][87], 63:11A:[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][55], 64:12A:[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][231]][65:13A:[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][295]] [2023-10-12 17:37:20,168 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:20,168 INFO L124 PetriNetUnfolderBase]: 33/64 cut-off events. [2023-10-12 17:37:20,168 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:37:20,168 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:20,169 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [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]true [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]true [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] 54#[L59-1, L41-1]true [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] 134#[L60, $Ultimate##0, L41-1]true [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[] 136#[L60, $Ultimate##0, writerEXIT]true [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] 138#[L28-1, L60, writerEXIT]true [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[] 140#[L28-1, L61]true [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[] 142#[L61, readerEXIT]true [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] 144#[L62]true [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[] 146#[L67]true [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] 148#[L67-1, $Ultimate##0]true [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] 150#[L67-1, L28-1]true [2023-10-12 17:37:20,169 INFO L750 eck$LassoCheckResult]: Loop: 150#[L67-1, L28-1]true [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] 150#[L67-1, L28-1]true [2023-10-12 17:37:20,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:20,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1979726675, now seen corresponding path program 1 times [2023-10-12 17:37:20,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:20,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237039199] [2023-10-12 17:37:20,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:20,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,177 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:20,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:20,185 INFO L85 PathProgramCache]: Analyzing trace with hash 149, now seen corresponding path program 1 times [2023-10-12 17:37:20,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:20,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145417361] [2023-10-12 17:37:20,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:20,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:20,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:20,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1241984899, now seen corresponding path program 1 times [2023-10-12 17:37:20,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:20,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953469978] [2023-10-12 17:37:20,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:20,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:20,314 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:37:20,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:37:20,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953469978] [2023-10-12 17:37:20,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953469978] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:37:20,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:37:20,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-10-12 17:37:20,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343641873] [2023-10-12 17:37:20,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:37:20,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:37:20,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-10-12 17:37:20,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-10-12 17:37:20,347 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 34 places, 320 transitions, 2208 flow. 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:37:20,347 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:37:20,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:37:20,484 INFO L124 PetriNetUnfolderBase]: 54/111 cut-off events. [2023-10-12 17:37:20,484 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-10-12 17:37:20,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 111 events. 54/111 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 261 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 419. Up to 86 conditions per place. [2023-10-12 17:37:20,488 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 66 selfloop transitions, 17 changer transitions 0/83 dead transitions. [2023-10-12 17:37:20,489 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 39 places, 83 transitions, 712 flow [2023-10-12 17:37:20,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-10-12 17:37:20,491 INFO L430 stractBuchiCegarLoop]: Abstraction has has 39 places, 83 transitions, 712 flow [2023-10-12 17:37:20,491 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:37:20,491 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 39 places, 83 transitions, 712 flow [2023-10-12 17:37:20,510 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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[][0], 2:2A:[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][1], 3:3A:[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][2], 6:4A:[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][4], 18:5A:[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[][10], 32:6A:[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[][22], 59:7A:[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][18], 86:8A:[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][27], 95:9A:[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[][47], 98:10A:[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][69], 100:11A:[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[][71], 103:12A:[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][74], 105:13A:[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][76]][106:14A:[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][78]] [2023-10-12 17:37:20,512 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:20,512 INFO L124 PetriNetUnfolderBase]: 53/105 cut-off events. [2023-10-12 17:37:20,512 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-10-12 17:37:20,512 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:20,513 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [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]true [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]true [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] 94#[L60, $Ultimate##0, $Ultimate##0]true [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] 134#[L60, $Ultimate##0, L41-1]true [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[] 136#[L60, $Ultimate##0, writerEXIT]true [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[] 184#[L61, $Ultimate##0]true [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] 140#[L28-1, L61]true [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] 140#[L28-1, L61]true [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[] 142#[L61, readerEXIT]true [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] 144#[L62]true [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[] 146#[L67]true [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] 148#[L67-1, $Ultimate##0]true [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] 150#[L67-1, L28-1]true [2023-10-12 17:37:20,513 INFO L750 eck$LassoCheckResult]: Loop: 150#[L67-1, L28-1]true [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] 150#[L67-1, L28-1]true [2023-10-12 17:37:20,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:20,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1821426075, now seen corresponding path program 1 times [2023-10-12 17:37:20,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:20,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404341379] [2023-10-12 17:37:20,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:20,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:20,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:20,543 INFO L85 PathProgramCache]: Analyzing trace with hash 149, now seen corresponding path program 2 times [2023-10-12 17:37:20,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:20,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805232645] [2023-10-12 17:37:20,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:20,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:20,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:20,568 INFO L85 PathProgramCache]: Analyzing trace with hash 629633595, now seen corresponding path program 1 times [2023-10-12 17:37:20,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:20,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169447329] [2023-10-12 17:37:20,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:20,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:20,924 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:20,925 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:20,925 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:20,925 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:20,925 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:20,925 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:20,925 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:20,925 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:20,925 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:37:20,925 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:20,925 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:20,927 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:37:20,931 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:37:20,933 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:37:20,935 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:37:20,938 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:37:20,941 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:37:21,024 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:37:21,223 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:21,223 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:21,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:21,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:21,225 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:37:21,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:21,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:21,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:21,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:21,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:21,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:21,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:21,248 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:37:21,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:21,295 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:37:21,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:21,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:21,297 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:37:21,300 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:37:21,301 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:37:21,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:21,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:21,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:21,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:21,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:21,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:21,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:21,329 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:37:21,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:21,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:21,331 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:37:21,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:21,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:21,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:21,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:21,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:21,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:21,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:21,351 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:37:21,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:21,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:21,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:21,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:21,376 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:37:21,378 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:37:21,379 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:37:21,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:21,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:21,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:21,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:21,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:21,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:21,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:21,405 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:37:21,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:21,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:21,407 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:37:21,415 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:37:21,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:21,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:21,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:21,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:21,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:21,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:21,427 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:37:21,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:21,447 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:37:21,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:21,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:21,449 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:37:21,451 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:37:21,453 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:37:21,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:21,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:21,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:21,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:21,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:21,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:21,496 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:21,512 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:37:21,512 INFO L444 ModelExtractionUtils]: 35 out of 46 variables were initially zero. Simplification set additionally 8 variables to zero. [2023-10-12 17:37:21,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:21,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:21,517 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:37:21,520 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:37:21,522 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:21,537 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:21,537 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:21,538 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:37:21,545 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:37:21,546 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:21,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:21,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:21,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:21,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:21,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:21,584 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:37:21,585 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:37:21,654 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:37:21,655 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:37:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2023-10-12 17:37:21,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 174 transitions. Stem has 13 letters. Loop has 1 letters. [2023-10-12 17:37:21,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:21,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 174 transitions. Stem has 14 letters. Loop has 1 letters. [2023-10-12 17:37:21,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:21,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 174 transitions. Stem has 13 letters. Loop has 2 letters. [2023-10-12 17:37:21,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:21,656 INFO L430 stractBuchiCegarLoop]: Abstraction has has 43 places, 332 transitions, 3512 flow [2023-10-12 17:37:21,657 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:37:21,657 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 43 places, 332 transitions, 3512 flow [2023-10-12 17:37:21,671 INFO L124 PetriNetUnfolderBase]: 54/111 cut-off events. [2023-10-12 17:37:21,671 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-10-12 17:37:21,671 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:37:21,676 INFO L201 PluginConnector]: Adding new model optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:21 BoogieIcfgContainer [2023-10-12 17:37:21,677 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:21,677 INFO L158 Benchmark]: Toolchain (without parser) took 4222.96ms. Allocated memory was 173.0MB in the beginning and 268.4MB in the end (delta: 95.4MB). Free memory was 124.1MB in the beginning and 185.9MB in the end (delta: -61.8MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-10-12 17:37:21,677 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 173.0MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:21,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.05ms. Allocated memory is still 173.0MB. Free memory was 124.0MB in the beginning and 122.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:21,678 INFO L158 Benchmark]: Boogie Preprocessor took 21.34ms. Allocated memory is still 173.0MB. Free memory was 122.5MB in the beginning and 121.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:21,679 INFO L158 Benchmark]: RCFGBuilder took 231.87ms. Allocated memory is still 173.0MB. Free memory was 121.3MB in the beginning and 111.8MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:37:21,679 INFO L158 Benchmark]: BuchiAutomizer took 3936.91ms. Allocated memory was 173.0MB in the beginning and 268.4MB in the end (delta: 95.4MB). Free memory was 111.7MB in the beginning and 185.9MB in the end (delta: -74.2MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:21,681 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.27ms. Allocated memory is still 173.0MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.05ms. Allocated memory is still 173.0MB. Free memory was 124.0MB in the beginning and 122.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.34ms. Allocated memory is still 173.0MB. Free memory was 122.5MB in the beginning and 121.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 231.87ms. Allocated memory is still 173.0MB. Free memory was 121.3MB in the beginning and 111.8MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3936.91ms. Allocated memory was 173.0MB in the beginning and 268.4MB in the end (delta: 95.4MB). Free memory was 111.7MB in the beginning and 185.9MB in the end (delta: -74.2MB). Peak memory consumption was 22.0MB. 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 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 2.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 403 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 400 mSDsluCounter, 302 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 103 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 400 IncrementalHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 199 mSDtfsCounter, 400 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: 294ms 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: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, 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:37:21,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:21,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...