/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/weaver-benchmarks/generated/parallel/min-max-1.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:38:26,586 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:38:26,624 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:38:26,639 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:38:26,639 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:38:26,639 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:38:26,640 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:38:26,640 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:38:26,641 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:38:26,641 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:38:26,641 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:38:26,641 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:38:26,642 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:38:26,642 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:38:26,642 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:38:26,642 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:38:26,642 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:38:26,643 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:38:26,643 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:38:26,643 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:38:26,643 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:38:26,644 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:38:26,644 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:38:26,644 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:38:26,644 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:38:26,644 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:38:26,644 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:38:26,645 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:38:26,645 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:38:26,645 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:38:26,645 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:38:26,645 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:38:26,646 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:38:26,646 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:38:26,646 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:38:26,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:38:26,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:38:26,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:38:26,848 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:38:26,849 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:38:26,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/min-max-1.wvr.bpl [2023-10-12 17:38:26,850 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/min-max-1.wvr.bpl' [2023-10-12 17:38:26,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:38:26,868 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:38:26,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:26,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:38:26,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:38:26,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:26" (1/1) ... [2023-10-12 17:38:26,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:26" (1/1) ... [2023-10-12 17:38:26,889 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:38:26,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:26,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:38:26,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:38:26,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:38:26,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:26" (1/1) ... [2023-10-12 17:38:26,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:26" (1/1) ... [2023-10-12 17:38:26,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:26" (1/1) ... [2023-10-12 17:38:26,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:26" (1/1) ... [2023-10-12 17:38:26,899 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:26" (1/1) ... [2023-10-12 17:38:26,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:26" (1/1) ... [2023-10-12 17:38:26,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:26" (1/1) ... [2023-10-12 17:38:26,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:26" (1/1) ... [2023-10-12 17:38:26,903 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:38:26,903 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:38:26,903 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:38:26,903 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:38:26,904 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:26" (1/1) ... [2023-10-12 17:38:26,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:26,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:26,924 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:38:26,941 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:38:26,973 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:38:26,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:38:26,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:38:26,973 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:38:26,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:38:26,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:38:26,974 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:38:26,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:38:26,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:38:26,974 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:38:26,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:38:26,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:38:26,975 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:38:27,008 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:38:27,010 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:38:27,101 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:38:27,106 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:38:27,106 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:38:27,107 INFO L201 PluginConnector]: Adding new model min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:27 BoogieIcfgContainer [2023-10-12 17:38:27,108 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:38:27,108 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:38:27,108 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:38:27,118 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:38:27,118 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:27,118 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:26" (1/2) ... [2023-10-12 17:38:27,119 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11ccea6 and model type min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:38:27, skipping insertion in model container [2023-10-12 17:38:27,119 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:27,120 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:27" (2/2) ... [2023-10-12 17:38:27,121 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-1.wvr.bpl [2023-10-12 17:38:27,182 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:38:27,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 90 flow [2023-10-12 17:38:27,217 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-10-12 17:38:27,218 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:38:27,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 2/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 46 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2023-10-12 17:38:27,221 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 33 transitions, 90 flow [2023-10-12 17:38:27,224 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 27 transitions, 72 flow [2023-10-12 17:38:27,226 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:38:27,235 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 27 transitions, 72 flow [2023-10-12 17:38:27,248 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 72 flow [2023-10-12 17:38:27,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 72 flow [2023-10-12 17:38:27,254 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-10-12 17:38:27,254 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:38:27,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 2/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 46 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2023-10-12 17:38:27,255 INFO L119 LiptonReduction]: Number of co-enabled transitions 218 [2023-10-12 17:38:27,617 INFO L134 LiptonReduction]: Checked pairs total: 267 [2023-10-12 17:38:27,618 INFO L136 LiptonReduction]: Total number of compositions: 10 [2023-10-12 17:38:27,626 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:38:27,627 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:38:27,627 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:38:27,627 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:38:27,627 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:38:27,627 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:38:27,627 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:38:27,627 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:38:27,628 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 18 transitions, 54 flow [2023-10-12 17:38:27,630 ERROR L47 etriNetUnfolderRabin]: [1:1A:[57] $Ultimate##0-->L51: Formula: (let ((.cse0 (not v_v_assert_1))) (and (= v_i_6 0) (= v_j_6 v_i_6) (or (and v_b2_2 v_v_assert_1) (and .cse0 (not v_b2_2))) .cse0 (or (and (not v_b1_2) .cse0) (and v_b1_2 v_v_assert_1)) (= (select v_A_5 0) v_min_4) (= v_max_4 v_min_4))) InVars {A=v_A_5, b2=v_b2_2, b1=v_b1_2, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_4, max=v_max_4} OutVars{A=v_A_5, b2=v_b2_2, b1=v_b1_2, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_4, max=v_max_4} AuxVars[] AssignedVars[][9], 2:2A:[80] L51-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0], 3:3A:[62] $Ultimate##0-->L23: Formula: (= (select v_A_1 0) v_min_1) InVars {A=v_A_1} OutVars{A=v_A_1, min=v_min_1} AuxVars[] AssignedVars[min][1], 5:4A:[63] L23-->L24-1: Formula: v_b1_1 InVars {} OutVars{b1=v_b1_1} AuxVars[] AssignedVars[b1][5]][6:5A:[98] L24-1-->L24-1: Formula: (and (< 0 v_i_16) (= v_i_15 (+ v_i_16 1)) (= (let ((.cse0 (select v_A_26 v_i_16))) (ite (< v_min_41 .cse0) v_min_41 .cse0)) v_min_40) (< v_i_16 v_N_15)) InVars {A=v_A_26, N=v_N_15, i=v_i_16, min=v_min_41} OutVars{A=v_A_26, N=v_N_15, i=v_i_15, min=v_min_40} AuxVars[] AssignedVars[i, min][17]] [2023-10-12 17:38:27,632 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:27,632 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-10-12 17:38:27,632 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:27,632 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:27,634 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:38:27,634 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 18 transitions, 54 flow [2023-10-12 17:38:27,635 ERROR L47 etriNetUnfolderRabin]: [1:1A:[57] $Ultimate##0-->L51: Formula: (let ((.cse0 (not v_v_assert_1))) (and (= v_i_6 0) (= v_j_6 v_i_6) (or (and v_b2_2 v_v_assert_1) (and .cse0 (not v_b2_2))) .cse0 (or (and (not v_b1_2) .cse0) (and v_b1_2 v_v_assert_1)) (= (select v_A_5 0) v_min_4) (= v_max_4 v_min_4))) InVars {A=v_A_5, b2=v_b2_2, b1=v_b1_2, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_4, max=v_max_4} OutVars{A=v_A_5, b2=v_b2_2, b1=v_b1_2, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_4, max=v_max_4} AuxVars[] AssignedVars[][9], 2:2A:[80] L51-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0], 3:3A:[62] $Ultimate##0-->L23: Formula: (= (select v_A_1 0) v_min_1) InVars {A=v_A_1} OutVars{A=v_A_1, min=v_min_1} AuxVars[] AssignedVars[min][1], 5:4A:[63] L23-->L24-1: Formula: v_b1_1 InVars {} OutVars{b1=v_b1_1} AuxVars[] AssignedVars[b1][5]][6:5A:[98] L24-1-->L24-1: Formula: (and (< 0 v_i_16) (= v_i_15 (+ v_i_16 1)) (= (let ((.cse0 (select v_A_26 v_i_16))) (ite (< v_min_41 .cse0) v_min_41 .cse0)) v_min_40) (< v_i_16 v_N_15)) InVars {A=v_A_26, N=v_N_15, i=v_i_16, min=v_min_41} OutVars{A=v_A_26, N=v_N_15, i=v_i_15, min=v_min_40} AuxVars[] AssignedVars[i, min][17]] [2023-10-12 17:38:27,636 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:27,636 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-10-12 17:38:27,636 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:27,636 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:27,639 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [57] $Ultimate##0-->L51: Formula: (let ((.cse0 (not v_v_assert_1))) (and (= v_i_6 0) (= v_j_6 v_i_6) (or (and v_b2_2 v_v_assert_1) (and .cse0 (not v_b2_2))) .cse0 (or (and (not v_b1_2) .cse0) (and v_b1_2 v_v_assert_1)) (= (select v_A_5 0) v_min_4) (= v_max_4 v_min_4))) InVars {A=v_A_5, b2=v_b2_2, b1=v_b1_2, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_4, max=v_max_4} OutVars{A=v_A_5, b2=v_b2_2, b1=v_b1_2, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_4, max=v_max_4} AuxVars[] AssignedVars[] 44#[L51]true [80] L51-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[$Ultimate##0, L51-1]true [62] $Ultimate##0-->L23: Formula: (= (select v_A_1 0) v_min_1) InVars {A=v_A_1} OutVars{A=v_A_1, min=v_min_1} AuxVars[] AssignedVars[min] 48#[L23, L51-1]true [63] L23-->L24-1: Formula: v_b1_1 InVars {} OutVars{b1=v_b1_1} AuxVars[] AssignedVars[b1] 50#[L24-1, L51-1]true [2023-10-12 17:38:27,639 INFO L750 eck$LassoCheckResult]: Loop: 50#[L24-1, L51-1]true [98] L24-1-->L24-1: Formula: (and (< 0 v_i_16) (= v_i_15 (+ v_i_16 1)) (= (let ((.cse0 (select v_A_26 v_i_16))) (ite (< v_min_41 .cse0) v_min_41 .cse0)) v_min_40) (< v_i_16 v_N_15)) InVars {A=v_A_26, N=v_N_15, i=v_i_16, min=v_min_41} OutVars{A=v_A_26, N=v_N_15, i=v_i_15, min=v_min_40} AuxVars[] AssignedVars[i, min] 50#[L24-1, L51-1]true [2023-10-12 17:38:27,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:27,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2700473, now seen corresponding path program 1 times [2023-10-12 17:38:27,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:27,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410977811] [2023-10-12 17:38:27,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:27,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:27,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:27,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:27,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:27,750 INFO L85 PathProgramCache]: Analyzing trace with hash 129, now seen corresponding path program 1 times [2023-10-12 17:38:27,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:27,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148807338] [2023-10-12 17:38:27,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:27,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:27,772 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:27,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:27,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:27,789 INFO L85 PathProgramCache]: Analyzing trace with hash 83714761, now seen corresponding path program 1 times [2023-10-12 17:38:27,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:27,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488332272] [2023-10-12 17:38:27,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:27,841 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:38:27,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:38:27,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488332272] [2023-10-12 17:38:27,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488332272] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:38:27,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:38:27,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:38:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583277625] [2023-10-12 17:38:27,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:38:27,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:38:27,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:38:27,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:38:27,933 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 26 places, 18 transitions, 54 flow. Second operand has 3 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:38:27,933 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:38:27,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:38:27,985 INFO L124 PetriNetUnfolderBase]: 85/150 cut-off events. [2023-10-12 17:38:27,986 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-10-12 17:38:27,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 150 events. 85/150 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 384 event pairs, 71 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 286. Up to 150 conditions per place. [2023-10-12 17:38:27,989 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 15 selfloop transitions, 1 changer transitions 0/16 dead transitions. [2023-10-12 17:38:27,990 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 27 places, 16 transitions, 82 flow [2023-10-12 17:38:27,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:38:27,994 INFO L430 stractBuchiCegarLoop]: Abstraction has has 27 places, 16 transitions, 82 flow [2023-10-12 17:38:27,994 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:38:27,994 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 27 places, 16 transitions, 82 flow [2023-10-12 17:38:27,999 ERROR L47 etriNetUnfolderRabin]: [1:1A:[57] $Ultimate##0-->L51: Formula: (let ((.cse0 (not v_v_assert_1))) (and (= v_i_6 0) (= v_j_6 v_i_6) (or (and v_b2_2 v_v_assert_1) (and .cse0 (not v_b2_2))) .cse0 (or (and (not v_b1_2) .cse0) (and v_b1_2 v_v_assert_1)) (= (select v_A_5 0) v_min_4) (= v_max_4 v_min_4))) InVars {A=v_A_5, b2=v_b2_2, b1=v_b1_2, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_4, max=v_max_4} OutVars{A=v_A_5, b2=v_b2_2, b1=v_b1_2, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_4, max=v_max_4} AuxVars[] AssignedVars[][0], 2:2A:[80] L51-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[83] L51-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][3], 11:4A:[69] $Ultimate##0-->L34: Formula: (= (select v_A_4 0) v_max_3) InVars {A=v_A_4} OutVars{A=v_A_4, max=v_max_3} AuxVars[] AssignedVars[max][6], 27:5A:[70] L34-->L35-1: Formula: v_b2_1 InVars {} OutVars{b2=v_b2_1} AuxVars[] AssignedVars[b2][9]][29:6A:[97] L35-1-->L35-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (< 0 v_j_16) (= v_max_31 (let ((.cse0 (select v_A_20 v_j_16))) (ite (< .cse0 v_max_32) v_max_32 .cse0))) (< v_j_16 v_N_11)) InVars {A=v_A_20, N=v_N_11, j=v_j_16, max=v_max_32} OutVars{A=v_A_20, N=v_N_11, j=v_j_15, max=v_max_31} AuxVars[] AssignedVars[j, max][10]] [2023-10-12 17:38:28,000 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:28,000 INFO L124 PetriNetUnfolderBase]: 13/28 cut-off events. [2023-10-12 17:38:28,000 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:38:28,000 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:28,001 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [57] $Ultimate##0-->L51: Formula: (let ((.cse0 (not v_v_assert_1))) (and (= v_i_6 0) (= v_j_6 v_i_6) (or (and v_b2_2 v_v_assert_1) (and .cse0 (not v_b2_2))) .cse0 (or (and (not v_b1_2) .cse0) (and v_b1_2 v_v_assert_1)) (= (select v_A_5 0) v_min_4) (= v_max_4 v_min_4))) InVars {A=v_A_5, b2=v_b2_2, b1=v_b1_2, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_4, max=v_max_4} OutVars{A=v_A_5, b2=v_b2_2, b1=v_b1_2, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_4, max=v_max_4} AuxVars[] AssignedVars[] 44#[L51]true [80] L51-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[$Ultimate##0, L51-1]true [83] L51-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 72#[$Ultimate##0, $Ultimate##0, L52]true [69] $Ultimate##0-->L34: Formula: (= (select v_A_4 0) v_max_3) InVars {A=v_A_4} OutVars{A=v_A_4, max=v_max_3} AuxVars[] AssignedVars[max] 74#[$Ultimate##0, L52, L34]true [70] L34-->L35-1: Formula: v_b2_1 InVars {} OutVars{b2=v_b2_1} AuxVars[] AssignedVars[b2] 76#[$Ultimate##0, L52, L35-1]true [2023-10-12 17:38:28,001 INFO L750 eck$LassoCheckResult]: Loop: 76#[$Ultimate##0, L52, L35-1]true [97] L35-1-->L35-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (< 0 v_j_16) (= v_max_31 (let ((.cse0 (select v_A_20 v_j_16))) (ite (< .cse0 v_max_32) v_max_32 .cse0))) (< v_j_16 v_N_11)) InVars {A=v_A_20, N=v_N_11, j=v_j_16, max=v_max_32} OutVars{A=v_A_20, N=v_N_11, j=v_j_15, max=v_max_31} AuxVars[] AssignedVars[j, max] 76#[$Ultimate##0, L52, L35-1]true [2023-10-12 17:38:28,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:28,001 INFO L85 PathProgramCache]: Analyzing trace with hash 83735100, now seen corresponding path program 1 times [2023-10-12 17:38:28,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:28,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140061363] [2023-10-12 17:38:28,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:28,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:28,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:28,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:28,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:28,022 INFO L85 PathProgramCache]: Analyzing trace with hash 128, now seen corresponding path program 1 times [2023-10-12 17:38:28,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:28,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189958712] [2023-10-12 17:38:28,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:28,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:28,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:28,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:28,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:28,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1699179099, now seen corresponding path program 1 times [2023-10-12 17:38:28,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:28,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553832395] [2023-10-12 17:38:28,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:28,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:28,072 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:38:28,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:38:28,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553832395] [2023-10-12 17:38:28,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553832395] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:38:28,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:38:28,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:38:28,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550439083] [2023-10-12 17:38:28,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:38:28,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:38:28,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:38:28,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:38:28,115 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 27 places, 16 transitions, 82 flow. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:38:28,115 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:38:28,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:38:28,147 INFO L124 PetriNetUnfolderBase]: 71/136 cut-off events. [2023-10-12 17:38:28,147 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-10-12 17:38:28,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 136 events. 71/136 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 371 event pairs, 71 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 373. Up to 136 conditions per place. [2023-10-12 17:38:28,149 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 14 selfloop transitions, 1 changer transitions 0/15 dead transitions. [2023-10-12 17:38:28,150 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 29 places, 15 transitions, 108 flow [2023-10-12 17:38:28,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:38:28,151 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 15 transitions, 108 flow [2023-10-12 17:38:28,151 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:38:28,151 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 15 transitions, 108 flow [2023-10-12 17:38:28,188 INFO L124 PetriNetUnfolderBase]: 71/136 cut-off events. [2023-10-12 17:38:28,188 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-10-12 17:38:28,188 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:38:28,192 INFO L201 PluginConnector]: Adding new model min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:38:28 BoogieIcfgContainer [2023-10-12 17:38:28,192 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:38:28,193 INFO L158 Benchmark]: Toolchain (without parser) took 1325.25ms. Allocated memory was 178.3MB in the beginning and 243.3MB in the end (delta: 65.0MB). Free memory was 126.6MB in the beginning and 179.5MB in the end (delta: -52.9MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2023-10-12 17:38:28,194 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.23ms. Allocated memory is still 178.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:38:28,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.57ms. Allocated memory is still 178.3MB. Free memory was 126.4MB in the beginning and 124.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:38:28,194 INFO L158 Benchmark]: Boogie Preprocessor took 11.98ms. Allocated memory is still 178.3MB. Free memory was 124.9MB in the beginning and 123.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:38:28,195 INFO L158 Benchmark]: RCFGBuilder took 204.48ms. Allocated memory is still 178.3MB. Free memory was 123.9MB in the beginning and 114.0MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:38:28,195 INFO L158 Benchmark]: BuchiAutomizer took 1084.08ms. Allocated memory was 178.3MB in the beginning and 243.3MB in the end (delta: 65.0MB). Free memory was 113.8MB in the beginning and 179.5MB in the end (delta: -65.7MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:38:28,197 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.23ms. Allocated memory is still 178.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.57ms. Allocated memory is still 178.3MB. Free memory was 126.4MB in the beginning and 124.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.98ms. Allocated memory is still 178.3MB. Free memory was 124.9MB in the beginning and 123.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 204.48ms. Allocated memory is still 178.3MB. Free memory was 123.9MB in the beginning and 114.0MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1084.08ms. Allocated memory was 178.3MB in the beginning and 243.3MB in the end (delta: 65.0MB). Free memory was 113.8MB in the beginning and 179.5MB in the end (delta: -65.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic). 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.9s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 0.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 10 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: 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, 35 PlacesBefore, 26 PlacesAfterwards, 27 TransitionsBefore, 18 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 267 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 166, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 132, independent: 119, independent conditional: 0, independent unconditional: 119, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 132, independent: 119, independent conditional: 0, independent unconditional: 119, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 166, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 132, unknown conditional: 0, unknown unconditional: 132] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, 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:38:28,212 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...