Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r295-tall-167873947700284.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is PhilosophersDyn-COL-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947700284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.2K Feb 26 12:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 12:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 12:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 12:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 32K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-00
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-01
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-02
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-03
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-04
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-05
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-06
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-07
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-08
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-09
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-10
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-11
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-12
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-13
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-14
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678815131710

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 17:32:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 17:32:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 17:32:13] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 17:32:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 17:32:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 438 ms
[2023-03-14 17:32:13] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 170 PT places and 2320.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 17:32:14] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 4 ms.
[2023-03-14 17:32:14] [INFO ] Skeletonized 10 HLPN properties in 1 ms. Removed 6 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA PhilosophersDyn-COL-10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 8 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 756 steps, including 55 resets, run visited all 11 properties in 30 ms. (steps per millisecond=25 )
[2023-03-14 17:32:14] [INFO ] Flatten gal took : 14 ms
[2023-03-14 17:32:14] [INFO ] Flatten gal took : 2 ms
Domain [Philosopher(10), Philosopher(10)] of place Neighbourhood breaks symmetries in sort Philosopher
[2023-03-14 17:32:14] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions 18190 arcs in 75 ms.
[2023-03-14 17:32:14] [INFO ] Unfolded 14 HLPN properties in 7 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-14 17:32:14] [INFO ] Reduced 89 identical enabling conditions.
[2023-03-14 17:32:14] [INFO ] Reduced 89 identical enabling conditions.
[2023-03-14 17:32:14] [INFO ] Reduced 89 identical enabling conditions.
[2023-03-14 17:32:14] [INFO ] Reduced 89 identical enabling conditions.
[2023-03-14 17:32:14] [INFO ] Reduced 89 identical enabling conditions.
[2023-03-14 17:32:14] [INFO ] Reduced 89 identical enabling conditions.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA PhilosophersDyn-COL-10-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 170 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 35 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2023-03-14 17:32:14] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2023-03-14 17:32:14] [INFO ] Computed 39 place invariants in 70 ms
[2023-03-14 17:32:15] [INFO ] Dead Transitions using invariants and state equation in 1029 ms found 380 transitions.
Found 380 dead transitions using SMT.
Drop transitions removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 17:32:15] [INFO ] Computed 39 place invariants in 42 ms
[2023-03-14 17:32:15] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-14 17:32:16] [INFO ] Invariant cache hit.
[2023-03-14 17:32:16] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:32:16] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 16 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1737 ms. Remains : 170/170 places, 1885/2265 transitions.
Support contains 170 out of 170 places after structural reductions.
[2023-03-14 17:32:17] [INFO ] Flatten gal took : 332 ms
[2023-03-14 17:32:18] [INFO ] Flatten gal took : 279 ms
[2023-03-14 17:32:19] [INFO ] Input system was already deterministic with 1885 transitions.
Finished random walk after 143 steps, including 18 resets, run visited all 15 properties in 35 ms. (steps per millisecond=4 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p1)&&p0))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:32:20] [INFO ] Invariant cache hit.
[2023-03-14 17:32:21] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
[2023-03-14 17:32:21] [INFO ] Invariant cache hit.
[2023-03-14 17:32:21] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-14 17:32:21] [INFO ] Invariant cache hit.
[2023-03-14 17:32:21] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:32:23] [INFO ] Implicit Places using invariants and state equation in 2220 ms returned []
Implicit Place search using SMT with State Equation took 2311 ms to find 0 implicit places.
[2023-03-14 17:32:23] [INFO ] Invariant cache hit.
[2023-03-14 17:32:24] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3608 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s100 1) (GEQ s101 1) (GEQ s102 1) (GEQ s103 1) (GEQ s104 1) (GEQ s105 1) (GEQ s106 1) (GEQ s107 1) (GEQ s108 1) (GEQ s109 1)), p0:(AND (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA PhilosophersDyn-COL-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLFireability-00 finished in 4006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 201 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:32:24] [INFO ] Invariant cache hit.
[2023-03-14 17:32:25] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
[2023-03-14 17:32:25] [INFO ] Invariant cache hit.
[2023-03-14 17:32:25] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-14 17:32:25] [INFO ] Invariant cache hit.
[2023-03-14 17:32:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:32:32] [INFO ] Implicit Places using invariants and state equation in 6868 ms returned []
Implicit Place search using SMT with State Equation took 7202 ms to find 0 implicit places.
[2023-03-14 17:32:32] [INFO ] Redundant transitions in 105 ms returned []
[2023-03-14 17:32:32] [INFO ] Invariant cache hit.
[2023-03-14 17:32:33] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8790 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 35 ms :[p0]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s100 1) (GEQ s101 1) (GEQ s102 1) (GEQ s103 1) (GEQ s104 1) (GEQ s105 1) (GEQ s106 1) (GEQ s107 1) (GEQ s108 1) (GEQ s109 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11957 reset in 790 ms.
Product exploration explored 100000 steps with 11942 reset in 722 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p0]
Stuttering acceptance computed with spot in 45 ms :[p0]
[2023-03-14 17:32:35] [INFO ] Invariant cache hit.
[2023-03-14 17:32:35] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-14 17:32:35] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 11 ms returned sat
[2023-03-14 17:32:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:32:36] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2023-03-14 17:32:36] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:32:36] [INFO ] [Real]Added 1010 Read/Feed constraints in 128 ms returned sat
[2023-03-14 17:32:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 259 ms.
[2023-03-14 17:32:37] [INFO ] Added : 0 causal constraints over 0 iterations in 436 ms. Result :sat
Could not prove EG p0
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 110 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:32:37] [INFO ] Invariant cache hit.
[2023-03-14 17:32:37] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
[2023-03-14 17:32:37] [INFO ] Invariant cache hit.
[2023-03-14 17:32:38] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-14 17:32:38] [INFO ] Invariant cache hit.
[2023-03-14 17:32:38] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:32:45] [INFO ] Implicit Places using invariants and state equation in 6861 ms returned []
Implicit Place search using SMT with State Equation took 7191 ms to find 0 implicit places.
[2023-03-14 17:32:45] [INFO ] Redundant transitions in 95 ms returned []
[2023-03-14 17:32:45] [INFO ] Invariant cache hit.
[2023-03-14 17:32:45] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8667 ms. Remains : 170/170 places, 1885/1885 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[p0]
Stuttering acceptance computed with spot in 39 ms :[p0]
[2023-03-14 17:32:46] [INFO ] Invariant cache hit.
[2023-03-14 17:32:46] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-14 17:32:46] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 11 ms returned sat
[2023-03-14 17:32:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:32:47] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2023-03-14 17:32:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:32:47] [INFO ] [Real]Added 1010 Read/Feed constraints in 168 ms returned sat
[2023-03-14 17:32:47] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 191 ms.
[2023-03-14 17:32:47] [INFO ] Added : 0 causal constraints over 0 iterations in 413 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 71 ms :[p0]
Product exploration explored 100000 steps with 11975 reset in 683 ms.
Product exploration explored 100000 steps with 11936 reset in 699 ms.
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 106 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:32:49] [INFO ] Invariant cache hit.
[2023-03-14 17:32:50] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
[2023-03-14 17:32:50] [INFO ] Invariant cache hit.
[2023-03-14 17:32:50] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-14 17:32:50] [INFO ] Invariant cache hit.
[2023-03-14 17:32:50] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:32:57] [INFO ] Implicit Places using invariants and state equation in 6864 ms returned []
Implicit Place search using SMT with State Equation took 7182 ms to find 0 implicit places.
[2023-03-14 17:32:57] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-14 17:32:57] [INFO ] Invariant cache hit.
[2023-03-14 17:32:58] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8573 ms. Remains : 170/170 places, 1885/1885 transitions.
Treatment of property PhilosophersDyn-COL-10-LTLFireability-01 finished in 34209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 120 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 108 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:32:58] [INFO ] Invariant cache hit.
[2023-03-14 17:32:59] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
[2023-03-14 17:32:59] [INFO ] Invariant cache hit.
[2023-03-14 17:32:59] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-14 17:32:59] [INFO ] Invariant cache hit.
[2023-03-14 17:32:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:33:01] [INFO ] Implicit Places using invariants and state equation in 2253 ms returned []
Implicit Place search using SMT with State Equation took 2466 ms to find 0 implicit places.
[2023-03-14 17:33:01] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-14 17:33:01] [INFO ] Invariant cache hit.
[2023-03-14 17:33:02] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3844 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s16 1) (GEQ s151 1) (GEQ s161 1)) (AND (GEQ s56 1) (GEQ s155 1) (GEQ s165 1)) (AND (GEQ s96 1) (GEQ s159 1) (GEQ s169 1)) (AND (GEQ s99 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLFireability-04 finished in 3957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 84 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:33:02] [INFO ] Invariant cache hit.
[2023-03-14 17:33:03] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
[2023-03-14 17:33:03] [INFO ] Invariant cache hit.
[2023-03-14 17:33:03] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-14 17:33:03] [INFO ] Invariant cache hit.
[2023-03-14 17:33:03] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:33:05] [INFO ] Implicit Places using invariants and state equation in 2117 ms returned []
Implicit Place search using SMT with State Equation took 2187 ms to find 0 implicit places.
[2023-03-14 17:33:05] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-14 17:33:05] [INFO ] Invariant cache hit.
[2023-03-14 17:33:06] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3515 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s100 1) (GEQ s101 1) (GEQ s102 1) (GEQ s103 1) (GEQ s104 1) (GEQ s105 1) (GEQ s106 1) (GEQ s107 1) (GEQ s108 1) (GEQ s109 1))) (OR ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 19139 reset in 3188 ms.
Product exploration explored 100000 steps with 19399 reset in 3015 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 303 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 272 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2023-03-14 17:33:16] [INFO ] Invariant cache hit.
Could not prove EG (AND p0 (NOT p1))
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 85 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:33:32] [INFO ] Invariant cache hit.
[2023-03-14 17:33:32] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
[2023-03-14 17:33:32] [INFO ] Invariant cache hit.
[2023-03-14 17:33:32] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-14 17:33:32] [INFO ] Invariant cache hit.
[2023-03-14 17:33:33] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:33:34] [INFO ] Implicit Places using invariants and state equation in 2123 ms returned []
Implicit Place search using SMT with State Equation took 2208 ms to find 0 implicit places.
[2023-03-14 17:33:35] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-14 17:33:35] [INFO ] Invariant cache hit.
[2023-03-14 17:33:35] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3705 ms. Remains : 170/170 places, 1885/1885 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 248 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 282 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2023-03-14 17:33:40] [INFO ] Invariant cache hit.
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 90 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 19317 reset in 942 ms.
Product exploration explored 100000 steps with 19215 reset in 969 ms.
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 90 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:33:57] [INFO ] Invariant cache hit.
[2023-03-14 17:33:57] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
[2023-03-14 17:33:57] [INFO ] Invariant cache hit.
[2023-03-14 17:33:58] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-14 17:33:58] [INFO ] Invariant cache hit.
[2023-03-14 17:33:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:34:00] [INFO ] Implicit Places using invariants and state equation in 2133 ms returned []
Implicit Place search using SMT with State Equation took 2201 ms to find 0 implicit places.
[2023-03-14 17:34:00] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-14 17:34:00] [INFO ] Invariant cache hit.
[2023-03-14 17:34:00] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3529 ms. Remains : 170/170 places, 1885/1885 transitions.
Treatment of property PhilosophersDyn-COL-10-LTLFireability-06 finished in 58521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(G(((p2 U p3)||p1))))))'
Support contains 150 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 82 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:34:01] [INFO ] Invariant cache hit.
[2023-03-14 17:34:01] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
[2023-03-14 17:34:01] [INFO ] Invariant cache hit.
[2023-03-14 17:34:01] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-14 17:34:01] [INFO ] Invariant cache hit.
[2023-03-14 17:34:02] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:34:03] [INFO ] Implicit Places using invariants and state equation in 1713 ms returned []
Implicit Place search using SMT with State Equation took 1779 ms to find 0 implicit places.
[2023-03-14 17:34:03] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-14 17:34:03] [INFO ] Invariant cache hit.
[2023-03-14 17:34:04] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3139 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(OR p1 p3 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={1} source=2 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=3 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={1} source=5 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={1} source=5 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (LT s114 1) (LT s115 1) (LT s112 1) (LT s113 1) (LT s118 1) (LT s119 1) (LT s116 1) (LT s117 1) (LT s110 1) (LT s111 1)) (AND (GEQ s16 1) (GEQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLFireability-07 finished in 3513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 92 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:34:04] [INFO ] Invariant cache hit.
[2023-03-14 17:34:05] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
[2023-03-14 17:34:05] [INFO ] Invariant cache hit.
[2023-03-14 17:34:05] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-14 17:34:05] [INFO ] Invariant cache hit.
[2023-03-14 17:34:06] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:34:13] [INFO ] Implicit Places using invariants and state equation in 7322 ms returned []
Implicit Place search using SMT with State Equation took 7678 ms to find 0 implicit places.
[2023-03-14 17:34:13] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-14 17:34:13] [INFO ] Invariant cache hit.
[2023-03-14 17:34:13] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8977 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 33 ms :[p0]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s114 1) (GEQ s115 1) (GEQ s112 1) (GEQ s113 1) (GEQ s118 1) (GEQ s119 1) (GEQ s116 1) (GEQ s117 1) (GEQ s110 1) (GEQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11941 reset in 728 ms.
Stack based approach found an accepted trace after 1132 steps with 139 reset with depth 8 and stack size 8 in 14 ms.
FORMULA PhilosophersDyn-COL-10-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-COL-10-LTLFireability-08 finished in 9774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&F(p2)))))'
Support contains 140 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:34:14] [INFO ] Invariant cache hit.
[2023-03-14 17:34:15] [INFO ] Dead Transitions using invariants and state equation in 580 ms found 0 transitions.
[2023-03-14 17:34:15] [INFO ] Invariant cache hit.
[2023-03-14 17:34:15] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-14 17:34:15] [INFO ] Invariant cache hit.
[2023-03-14 17:34:15] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:34:16] [INFO ] Implicit Places using invariants and state equation in 1743 ms returned []
Implicit Place search using SMT with State Equation took 1818 ms to find 0 implicit places.
[2023-03-14 17:34:16] [INFO ] Invariant cache hit.
[2023-03-14 17:34:17] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3007 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(OR (AND (GEQ s122 1) (GEQ s132 1)) (AND (GEQ s126 1) (GEQ s136 1)) (AND (GEQ s120 1) (GEQ s130 1)) (AND (GEQ s124 1) (GEQ s134 1)) (AND (GEQ s128 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 55 steps with 9 reset in 4 ms.
FORMULA PhilosophersDyn-COL-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLFireability-09 finished in 3272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||p0)))'
Support contains 150 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 83 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:34:17] [INFO ] Invariant cache hit.
[2023-03-14 17:34:18] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
[2023-03-14 17:34:18] [INFO ] Invariant cache hit.
[2023-03-14 17:34:18] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-14 17:34:18] [INFO ] Invariant cache hit.
[2023-03-14 17:34:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:34:19] [INFO ] Implicit Places using invariants and state equation in 1239 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
[2023-03-14 17:34:19] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-14 17:34:19] [INFO ] Invariant cache hit.
[2023-03-14 17:34:20] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2660 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(AND (OR (LT s49 1) (LT s129 1) (LT s144 1)) (OR (LT s8 1) (LT s128 1) (LT s140 1)) (OR (LT s67 1) (LT s127 1) (LT s146 1)) (OR (LT s44 1) (LT s124 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLFireability-10 finished in 2770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U (p1 U p2))||G(p1))))'
Support contains 140 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:34:20] [INFO ] Invariant cache hit.
[2023-03-14 17:34:21] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
[2023-03-14 17:34:21] [INFO ] Invariant cache hit.
[2023-03-14 17:34:21] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-14 17:34:21] [INFO ] Invariant cache hit.
[2023-03-14 17:34:21] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:34:23] [INFO ] Implicit Places using invariants and state equation in 1775 ms returned []
Implicit Place search using SMT with State Equation took 1892 ms to find 0 implicit places.
[2023-03-14 17:34:23] [INFO ] Invariant cache hit.
[2023-03-14 17:34:23] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3126 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (GEQ s16 1) (GEQ s151 1) (GEQ s161 1)) (AND (GEQ s56 1) (GEQ s155 1) (GEQ s165 1)) (AND (GEQ s96 1) (GEQ s159 1) (GEQ s169 1)) (AND (GEQ s99 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 2 ms.
FORMULA PhilosophersDyn-COL-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLFireability-11 finished in 3380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(G(p0))||(!p1&&X(p0)))))'
Support contains 120 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:34:23] [INFO ] Invariant cache hit.
[2023-03-14 17:34:24] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
[2023-03-14 17:34:24] [INFO ] Invariant cache hit.
[2023-03-14 17:34:24] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-14 17:34:24] [INFO ] Invariant cache hit.
[2023-03-14 17:34:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:34:27] [INFO ] Implicit Places using invariants and state equation in 2623 ms returned []
Implicit Place search using SMT with State Equation took 2745 ms to find 0 implicit places.
[2023-03-14 17:34:27] [INFO ] Invariant cache hit.
[2023-03-14 17:34:27] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3969 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s114 1) (GEQ s115 1) (GEQ s112 1) (GEQ s113 1) (GEQ s118 1) (GEQ s119 1) (GEQ s116 1) (GEQ s117 1) (GEQ s110 1) (GEQ s111 1)), p1:(OR (AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3977 ms.
Product exploration explored 100000 steps with 50000 reset in 3850 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (AND p1 p0)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 205 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-10-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-10-LTLFireability-12 finished in 12214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(!p1)))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 82 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:34:36] [INFO ] Invariant cache hit.
[2023-03-14 17:34:36] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
[2023-03-14 17:34:36] [INFO ] Invariant cache hit.
[2023-03-14 17:34:36] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-14 17:34:36] [INFO ] Invariant cache hit.
[2023-03-14 17:34:37] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:34:39] [INFO ] Implicit Places using invariants and state equation in 2161 ms returned []
Implicit Place search using SMT with State Equation took 2291 ms to find 0 implicit places.
[2023-03-14 17:34:39] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-14 17:34:39] [INFO ] Invariant cache hit.
[2023-03-14 17:34:39] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3599 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s49 1) (LT s129 1) (LT s144 1)) (OR (LT s8 1) (LT s128 1) (LT s140 1)) (OR (LT s67 1) (LT s127 1) (LT s146 1)) (OR (LT s44 1) (LT s124 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 12153 reset in 5143 ms.
Stack based approach found an accepted trace after 2552 steps with 309 reset with depth 7 and stack size 7 in 132 ms.
FORMULA PhilosophersDyn-COL-10-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-COL-10-LTLFireability-13 finished in 9047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 95 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:34:45] [INFO ] Invariant cache hit.
[2023-03-14 17:34:45] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
[2023-03-14 17:34:45] [INFO ] Invariant cache hit.
[2023-03-14 17:34:46] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-14 17:34:46] [INFO ] Invariant cache hit.
[2023-03-14 17:34:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:34:53] [INFO ] Implicit Places using invariants and state equation in 6900 ms returned []
Implicit Place search using SMT with State Equation took 7214 ms to find 0 implicit places.
[2023-03-14 17:34:53] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-14 17:34:53] [INFO ] Invariant cache hit.
[2023-03-14 17:34:53] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8620 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s100 1) (GEQ s101 1) (GEQ s102 1) (GEQ s103 1) (GEQ s104 1) (GEQ s105 1) (GEQ s106 1) (GEQ s107 1) (GEQ s108 1) (GEQ s109 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLFireability-14 finished in 8738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
[2023-03-14 17:34:54] [INFO ] Flatten gal took : 118 ms
[2023-03-14 17:34:54] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 11 ms.
[2023-03-14 17:34:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 1885 transitions and 14300 arcs took 12 ms.
Total runtime 161112 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PhilosophersDyn-COL-10
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
LTLFireability

FORMULA PhilosophersDyn-COL-10-LTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-LTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678815422172

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 PhilosophersDyn-COL-10-LTLFireability-01
lola: time limit : 1795 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1795 1/32 PhilosophersDyn-COL-10-LTLFireability-01 18641 m, 3728 m/sec, 48213 t fired, .

Time elapsed: 15 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1795 1/32 PhilosophersDyn-COL-10-LTLFireability-01 38928 m, 4057 m/sec, 105518 t fired, .

Time elapsed: 20 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1795 1/32 PhilosophersDyn-COL-10-LTLFireability-01 63440 m, 4902 m/sec, 171505 t fired, .

Time elapsed: 25 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1795 1/32 PhilosophersDyn-COL-10-LTLFireability-01 89177 m, 5147 m/sec, 245032 t fired, .

Time elapsed: 30 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1795 1/32 PhilosophersDyn-COL-10-LTLFireability-01 114947 m, 5154 m/sec, 318310 t fired, .

Time elapsed: 35 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1795 2/32 PhilosophersDyn-COL-10-LTLFireability-01 138439 m, 4698 m/sec, 386263 t fired, .

Time elapsed: 40 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1795 2/32 PhilosophersDyn-COL-10-LTLFireability-01 161631 m, 4638 m/sec, 453164 t fired, .

Time elapsed: 45 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/1795 2/32 PhilosophersDyn-COL-10-LTLFireability-01 183344 m, 4342 m/sec, 516192 t fired, .

Time elapsed: 50 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
lola: FINISHED task # 1 (type EXCL) for PhilosophersDyn-COL-10-LTLFireability-01
lola: result : true
lola: markings : 195260
lola: fired transitions : 550787
lola: time used : 43.000000
lola: memory pages used : 2
lola: LAUNCH task # 4 (type EXCL) for 3 PhilosophersDyn-COL-10-LTLFireability-06
lola: time limit : 3547 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 2/3547 1/32 PhilosophersDyn-COL-10-LTLFireability-06 12890 m, 2578 m/sec, 38029 t fired, .

Time elapsed: 55 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 7/3547 1/32 PhilosophersDyn-COL-10-LTLFireability-06 40840 m, 5590 m/sec, 123641 t fired, .

Time elapsed: 60 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 12/3547 1/32 PhilosophersDyn-COL-10-LTLFireability-06 68123 m, 5456 m/sec, 210547 t fired, .

Time elapsed: 65 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 17/3547 1/32 PhilosophersDyn-COL-10-LTLFireability-06 95358 m, 5447 m/sec, 298962 t fired, .

Time elapsed: 70 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 22/3547 1/32 PhilosophersDyn-COL-10-LTLFireability-06 122434 m, 5415 m/sec, 381171 t fired, .

Time elapsed: 75 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 27/3547 2/32 PhilosophersDyn-COL-10-LTLFireability-06 149312 m, 5375 m/sec, 466022 t fired, .

Time elapsed: 80 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 32/3547 2/32 PhilosophersDyn-COL-10-LTLFireability-06 176335 m, 5404 m/sec, 554067 t fired, .

Time elapsed: 85 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 37/3547 2/32 PhilosophersDyn-COL-10-LTLFireability-06 203882 m, 5509 m/sec, 642411 t fired, .

Time elapsed: 90 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 42/3547 2/32 PhilosophersDyn-COL-10-LTLFireability-06 231314 m, 5486 m/sec, 731544 t fired, .

Time elapsed: 95 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 47/3547 2/32 PhilosophersDyn-COL-10-LTLFireability-06 258557 m, 5448 m/sec, 820624 t fired, .

Time elapsed: 100 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 52/3547 3/32 PhilosophersDyn-COL-10-LTLFireability-06 286157 m, 5520 m/sec, 910424 t fired, .

Time elapsed: 105 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 57/3547 3/32 PhilosophersDyn-COL-10-LTLFireability-06 313178 m, 5404 m/sec, 998384 t fired, .

Time elapsed: 110 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 62/3547 3/32 PhilosophersDyn-COL-10-LTLFireability-06 339486 m, 5261 m/sec, 1084192 t fired, .

Time elapsed: 115 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 67/3547 3/32 PhilosophersDyn-COL-10-LTLFireability-06 366114 m, 5325 m/sec, 1171080 t fired, .

Time elapsed: 120 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 72/3547 3/32 PhilosophersDyn-COL-10-LTLFireability-06 392136 m, 5204 m/sec, 1256229 t fired, .

Time elapsed: 125 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
lola: FINISHED task # 4 (type EXCL) for PhilosophersDyn-COL-10-LTLFireability-06
lola: result : true
lola: markings : 400181
lola: fired transitions : 1282540
lola: time used : 74.000000
lola: memory pages used : 3
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLFireability-01: LTL true LTL model checker
PhilosophersDyn-COL-10-LTLFireability-06: LTL true LTL model checker


Time elapsed: 127 secs. Pages in use: 3

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-COL-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is PhilosophersDyn-COL-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r295-tall-167873947700284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-10.tgz
mv PhilosophersDyn-COL-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;