About the Execution of LTSMin+red for PhilosophersDyn-COL-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 412.640 | 22836.00 | 34908.00 | 653.70 | FFF?F?TFTTFFFFFT | normal |
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.r297-tall-167873950200276.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 ltsminxred
Input is PhilosophersDyn-COL-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950200276
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.5K Feb 26 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 12:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 12:06 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 3.8K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 12:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 12:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 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 31K 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-03-LTLFireability-00
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-01
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-02
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-03
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-04
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-05
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-06
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-07
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-08
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-09
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-10
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-11
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-12
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-13
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-14
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679480193262
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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-03
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 10:16:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 10:16:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 10:16:35] [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-22 10:16:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 10:16:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 493 ms
[2023-03-22 10:16:35] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 30 PT places and 87.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 10:16:35] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 4 ms.
[2023-03-22 10:16:35] [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-03-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-LTLFireability-08 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 33 steps, including 4 resets, run visited all 6 properties in 18 ms. (steps per millisecond=1 )
[2023-03-22 10:16:36] [INFO ] Flatten gal took : 14 ms
[2023-03-22 10:16:36] [INFO ] Flatten gal took : 3 ms
Domain [Philosopher(3), Philosopher(3)] of place Neighbourhood breaks symmetries in sort Philosopher
[2023-03-22 10:16:36] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions 564 arcs in 14 ms.
[2023-03-22 10:16:36] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
[2023-03-22 10:16:36] [INFO ] Reduced 5 identical enabling conditions.
[2023-03-22 10:16:36] [INFO ] Reduced 5 identical enabling conditions.
[2023-03-22 10:16:36] [INFO ] Reduced 5 identical enabling conditions.
[2023-03-22 10:16:36] [INFO ] Reduced 5 identical enabling conditions.
[2023-03-22 10:16:36] [INFO ] Reduced 5 identical enabling conditions.
[2023-03-22 10:16:36] [INFO ] Reduced 5 identical enabling conditions.
[2023-03-22 10:16:36] [INFO ] Reduced 5 identical enabling conditions.
[2023-03-22 10:16:36] [INFO ] Reduced 5 identical enabling conditions.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
FORMULA PhilosophersDyn-COL-03-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 20 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-22 10:16:36] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2023-03-22 10:16:36] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-22 10:16:36] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 30 transitions.
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
// Phase 1: matrix 51 rows 30 cols
[2023-03-22 10:16:36] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-22 10:16:36] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-22 10:16:36] [INFO ] Invariant cache hit.
[2023-03-22 10:16:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:36] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 495 ms. Remains : 30/30 places, 51/81 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-03-22 10:16:36] [INFO ] Flatten gal took : 33 ms
[2023-03-22 10:16:36] [INFO ] Flatten gal took : 17 ms
[2023-03-22 10:16:37] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 10000 steps, including 1436 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 300 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 10:16:37] [INFO ] Invariant cache hit.
[2023-03-22 10:16:37] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 10:16:37] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-22 10:16:37] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 11 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:37] [INFO ] Invariant cache hit.
[2023-03-22 10:16:38] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
[2023-03-22 10:16:38] [INFO ] Invariant cache hit.
[2023-03-22 10:16:38] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-22 10:16:38] [INFO ] Invariant cache hit.
[2023-03-22 10:16:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:38] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-22 10:16:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 10:16:38] [INFO ] Invariant cache hit.
[2023-03-22 10:16:38] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 314 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s17 1) (GEQ s20 1)) (AND (GEQ s16 1) (GEQ s19 1)) (AND (GEQ s15 1) (GEQ s18 1))), p1:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 20 steps with 4 reset in 3 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-00 finished in 723 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(G(p1))||p0)))'
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:38] [INFO ] Invariant cache hit.
[2023-03-22 10:16:38] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
[2023-03-22 10:16:38] [INFO ] Invariant cache hit.
[2023-03-22 10:16:38] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-22 10:16:38] [INFO ] Invariant cache hit.
[2023-03-22 10:16:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:38] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-22 10:16:38] [INFO ] Invariant cache hit.
[2023-03-22 10:16:38] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (AND (GEQ s6 1) (GEQ s15 1) (GEQ s23 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s8 1) (GEQ s17...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14344 reset in 439 ms.
Stack based approach found an accepted trace after 189 steps with 27 reset with depth 8 and stack size 8 in 1 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-01 finished in 838 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 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:39] [INFO ] Invariant cache hit.
[2023-03-22 10:16:39] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
[2023-03-22 10:16:39] [INFO ] Invariant cache hit.
[2023-03-22 10:16:39] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 10:16:39] [INFO ] Invariant cache hit.
[2023-03-22 10:16:39] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:39] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-22 10:16:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 10:16:39] [INFO ] Invariant cache hit.
[2023-03-22 10:16:39] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 255 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s8 2) (LT s14 1) (LT s17 1)) (OR (LT s0 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s5 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 14293 reset in 370 ms.
Stack based approach found an accepted trace after 23 steps with 3 reset with depth 5 and stack size 5 in 10 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-02 finished in 684 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 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:40] [INFO ] Invariant cache hit.
[2023-03-22 10:16:40] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
[2023-03-22 10:16:40] [INFO ] Invariant cache hit.
[2023-03-22 10:16:40] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 10:16:40] [INFO ] Invariant cache hit.
[2023-03-22 10:16:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:40] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-22 10:16:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 10:16:40] [INFO ] Invariant cache hit.
[2023-03-22 10:16:40] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-03 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 (OR (LT s6 1) (LT s15 1) (LT s23 1)) (OR (LT s3 1) (LT s15 1) (LT s22 1)) (OR (LT s1 1) (LT s16 1) (LT s21 1)) (OR (LT s8 1) (LT s17 1) (LT s23 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]]
Product exploration explored 100000 steps with 16888 reset in 238 ms.
Product exploration explored 100000 steps with 16770 reset in 245 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 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:41] [INFO ] Invariant cache hit.
[2023-03-22 10:16:41] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-22 10:16:41] [INFO ] Invariant cache hit.
[2023-03-22 10:16:41] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 10:16:41] [INFO ] Invariant cache hit.
[2023-03-22 10:16:41] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:41] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-22 10:16:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 10:16:41] [INFO ] Invariant cache hit.
[2023-03-22 10:16:41] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 191 ms. Remains : 30/30 places, 51/51 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 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 252 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16865 reset in 193 ms.
Product exploration explored 100000 steps with 16812 reset in 193 ms.
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:42] [INFO ] Invariant cache hit.
[2023-03-22 10:16:42] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
[2023-03-22 10:16:42] [INFO ] Invariant cache hit.
[2023-03-22 10:16:42] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 10:16:42] [INFO ] Invariant cache hit.
[2023-03-22 10:16:42] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:42] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-22 10:16:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 10:16:42] [INFO ] Invariant cache hit.
[2023-03-22 10:16:42] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 30/30 places, 51/51 transitions.
Treatment of property PhilosophersDyn-COL-03-LTLFireability-03 finished in 2876 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((X(p0)&&(p1||X(X(X(X(F(p2)))))))))'
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:43] [INFO ] Invariant cache hit.
[2023-03-22 10:16:43] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
[2023-03-22 10:16:43] [INFO ] Invariant cache hit.
[2023-03-22 10:16:43] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-22 10:16:43] [INFO ] Invariant cache hit.
[2023-03-22 10:16:43] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:43] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-22 10:16:43] [INFO ] Invariant cache hit.
[2023-03-22 10:16:43] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 306 ms :[(NOT p0), (NOT p2), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), true, (OR (NOT p0) (NOT p2))]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 5}, { cond=(NOT p0), acceptance={} source=7 dest: 6}]], initial=4, aps=[p0:(OR (AND (GEQ s17 1) (GEQ s20 1)) (AND (GEQ s16 1) (GEQ s19 1)) (AND (GEQ s15 1) (GEQ s18 1))), p2:(AND (OR (LT s4 1) (LT s10 1) (LT s16 2)) (OR (LT s8...], 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, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-04 finished in 550 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(X(F((p0||G(!p1))))))'
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:43] [INFO ] Invariant cache hit.
[2023-03-22 10:16:43] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-22 10:16:43] [INFO ] Invariant cache hit.
[2023-03-22 10:16:43] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 10:16:43] [INFO ] Invariant cache hit.
[2023-03-22 10:16:43] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:43] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-22 10:16:43] [INFO ] Invariant cache hit.
[2023-03-22 10:16:43] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (AND (GEQ s17 1) (GEQ s20 1)) (AND (GEQ s16 1) (GEQ s19 1)) (AND (GEQ s15 1) (GEQ s18 1))), p0:(AND (OR (LT s4 1) (LT s10 1) (LT s16 2)) (OR (LT s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 29514 reset in 250 ms.
Product exploration explored 100000 steps with 29535 reset in 266 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 (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 12 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:45] [INFO ] Invariant cache hit.
[2023-03-22 10:16:45] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-22 10:16:45] [INFO ] Invariant cache hit.
[2023-03-22 10:16:45] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 10:16:45] [INFO ] Invariant cache hit.
[2023-03-22 10:16:45] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:45] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-22 10:16:45] [INFO ] Invariant cache hit.
[2023-03-22 10:16:45] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 177 ms. Remains : 30/30 places, 51/51 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 (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 32 steps, including 4 resets, run visited all 2 properties in 1 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 29501 reset in 241 ms.
Product exploration explored 100000 steps with 29514 reset in 248 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:47] [INFO ] Invariant cache hit.
[2023-03-22 10:16:47] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2023-03-22 10:16:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 10:16:47] [INFO ] Invariant cache hit.
[2023-03-22 10:16:47] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 30/30 places, 51/51 transitions.
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:47] [INFO ] Invariant cache hit.
[2023-03-22 10:16:47] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-22 10:16:47] [INFO ] Invariant cache hit.
[2023-03-22 10:16:47] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 10:16:47] [INFO ] Invariant cache hit.
[2023-03-22 10:16:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:47] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-22 10:16:47] [INFO ] Invariant cache hit.
[2023-03-22 10:16:47] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 30/30 places, 51/51 transitions.
Treatment of property PhilosophersDyn-COL-03-LTLFireability-05 finished in 4133 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||X(G((p1||G(!p0)))))) U p0)))'
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:47] [INFO ] Invariant cache hit.
[2023-03-22 10:16:47] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-22 10:16:47] [INFO ] Invariant cache hit.
[2023-03-22 10:16:47] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-22 10:16:47] [INFO ] Invariant cache hit.
[2023-03-22 10:16:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:47] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-22 10:16:47] [INFO ] Invariant cache hit.
[2023-03-22 10:16:47] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (AND p0 (NOT p1)), true, p0]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s11 1)), p1:(AND (OR (LT s6 1) (LT s15 1) (LT s23 1)) (OR (LT s3 1) (LT s15 1) (LT s22 1)) (OR (LT s1 1) (LT s16 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-07 finished in 371 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(p0)||X((p1||G(p2)))))'
Support contains 21 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:48] [INFO ] Invariant cache hit.
[2023-03-22 10:16:48] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-22 10:16:48] [INFO ] Invariant cache hit.
[2023-03-22 10:16:48] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-22 10:16:48] [INFO ] Invariant cache hit.
[2023-03-22 10:16:48] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:48] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-22 10:16:48] [INFO ] Invariant cache hit.
[2023-03-22 10:16:48] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(OR (AND (GEQ s17 1) (GEQ s20 1)) (AND (GEQ s16 1) (GEQ s19 1)) (AND (GEQ s15 1) (GEQ s18 1))), p2:(AND (OR (LT s2 1) (LT s3 1) (LT s12 1) (LT s15 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Product exploration explored 100000 steps with 50000 reset in 198 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) p2 p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p2)))
Knowledge based reduction with 9 factoid took 433 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-03-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-03-LTLFireability-09 finished in 1307 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' '!(((p0 U !p1)&&X(G((p1||X(p0))))))'
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:49] [INFO ] Invariant cache hit.
[2023-03-22 10:16:49] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-22 10:16:49] [INFO ] Invariant cache hit.
[2023-03-22 10:16:49] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 10:16:49] [INFO ] Invariant cache hit.
[2023-03-22 10:16:49] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:49] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-22 10:16:49] [INFO ] Invariant cache hit.
[2023-03-22 10:16:49] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (OR (LT s2 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s8 2) (LT s14 1) (LT s17 1)) (OR (LT s0 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s5 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-10 finished in 372 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 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:49] [INFO ] Invariant cache hit.
[2023-03-22 10:16:49] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-22 10:16:49] [INFO ] Invariant cache hit.
[2023-03-22 10:16:49] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 10:16:49] [INFO ] Invariant cache hit.
[2023-03-22 10:16:49] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:49] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-22 10:16:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 10:16:49] [INFO ] Invariant cache hit.
[2023-03-22 10:16:49] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s8 2) (LT s14 1) (LT s17 1)) (OR (LT s0 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s5 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 14280 reset in 361 ms.
Stack based approach found an accepted trace after 325 steps with 50 reset with depth 10 and stack size 10 in 2 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-11 finished in 608 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(F(!p1))&&p0)))'
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:50] [INFO ] Invariant cache hit.
[2023-03-22 10:16:50] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2023-03-22 10:16:50] [INFO ] Invariant cache hit.
[2023-03-22 10:16:50] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-22 10:16:50] [INFO ] Invariant cache hit.
[2023-03-22 10:16:50] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:50] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-22 10:16:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 10:16:50] [INFO ] Invariant cache hit.
[2023-03-22 10:16:50] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) p1), p1, p1, (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s2 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s8 2) (LT s14 1) (LT s17 1)) (OR (LT s0 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s5 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-14 finished in 370 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)))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:50] [INFO ] Invariant cache hit.
[2023-03-22 10:16:50] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2023-03-22 10:16:50] [INFO ] Invariant cache hit.
[2023-03-22 10:16:50] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 10:16:50] [INFO ] Invariant cache hit.
[2023-03-22 10:16:50] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:50] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-22 10:16:50] [INFO ] Invariant cache hit.
[2023-03-22 10:16:50] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s8 2) (LT s14 1) (LT s17 1)) (OR (LT s0 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s5 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Product exploration explored 100000 steps with 50000 reset in 160 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))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-03-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-03-LTLFireability-15 finished in 672 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)))'
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(X(F((p0||G(!p1))))))'
Found a Shortening insensitive property : PhilosophersDyn-COL-03-LTLFireability-05
Stuttering acceptance computed with spot in 111 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:51] [INFO ] Invariant cache hit.
[2023-03-22 10:16:51] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2023-03-22 10:16:51] [INFO ] Invariant cache hit.
[2023-03-22 10:16:51] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 10:16:51] [INFO ] Invariant cache hit.
[2023-03-22 10:16:51] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:51] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-22 10:16:51] [INFO ] Invariant cache hit.
[2023-03-22 10:16:51] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 188 ms. Remains : 30/30 places, 51/51 transitions.
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (AND (GEQ s17 1) (GEQ s20 1)) (AND (GEQ s16 1) (GEQ s19 1)) (AND (GEQ s15 1) (GEQ s18 1))), p0:(AND (OR (LT s4 1) (LT s10 1) (LT s16 2)) (OR (LT s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 29525 reset in 199 ms.
Product exploration explored 100000 steps with 29515 reset in 219 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 (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:52] [INFO ] Invariant cache hit.
[2023-03-22 10:16:53] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-22 10:16:53] [INFO ] Invariant cache hit.
[2023-03-22 10:16:53] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-22 10:16:53] [INFO ] Invariant cache hit.
[2023-03-22 10:16:53] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:53] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-22 10:16:53] [INFO ] Invariant cache hit.
[2023-03-22 10:16:53] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 30/30 places, 51/51 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 (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 13 steps, including 1 resets, run visited all 2 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 29493 reset in 235 ms.
Product exploration explored 100000 steps with 29535 reset in 244 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:54] [INFO ] Invariant cache hit.
[2023-03-22 10:16:54] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-22 10:16:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 10:16:54] [INFO ] Invariant cache hit.
[2023-03-22 10:16:54] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 30/30 places, 51/51 transitions.
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 10:16:54] [INFO ] Invariant cache hit.
[2023-03-22 10:16:54] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-22 10:16:54] [INFO ] Invariant cache hit.
[2023-03-22 10:16:54] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 10:16:54] [INFO ] Invariant cache hit.
[2023-03-22 10:16:54] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:16:54] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-22 10:16:54] [INFO ] Invariant cache hit.
[2023-03-22 10:16:54] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 30/30 places, 51/51 transitions.
Treatment of property PhilosophersDyn-COL-03-LTLFireability-05 finished in 3418 ms.
[2023-03-22 10:16:54] [INFO ] Flatten gal took : 7 ms
[2023-03-22 10:16:54] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-22 10:16:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 51 transitions and 321 arcs took 1 ms.
Total runtime 19659 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1480/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1480/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PhilosophersDyn-COL-03-LTLFireability-03
Could not compute solution for formula : PhilosophersDyn-COL-03-LTLFireability-05
BK_STOP 1679480216098
--------------------
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
mcc2023
ltl formula name PhilosophersDyn-COL-03-LTLFireability-03
ltl formula formula --ltl=/tmp/1480/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 30 places, 51 transitions and 321 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1480/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1480/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1480/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1480/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55bd8f8de3f4]
1: pnml2lts-mc(+0xa2496) [0x55bd8f8de496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f94b149f140]
3: pnml2lts-mc(+0x405be5) [0x55bd8fc41be5]
4: pnml2lts-mc(+0x16b3f9) [0x55bd8f9a73f9]
5: pnml2lts-mc(+0x164ac4) [0x55bd8f9a0ac4]
6: pnml2lts-mc(+0x272e0a) [0x55bd8faaee0a]
7: pnml2lts-mc(+0xb61f0) [0x55bd8f8f21f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f94b12f24d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f94b12f267a]
10: pnml2lts-mc(+0xa1581) [0x55bd8f8dd581]
11: pnml2lts-mc(+0xa1910) [0x55bd8f8dd910]
12: pnml2lts-mc(+0xa32a2) [0x55bd8f8df2a2]
13: pnml2lts-mc(+0xa50f4) [0x55bd8f8e10f4]
14: pnml2lts-mc(+0x3f34b3) [0x55bd8fc2f4b3]
15: pnml2lts-mc(+0x7c63d) [0x55bd8f8b863d]
16: pnml2lts-mc(+0x67d86) [0x55bd8f8a3d86]
17: pnml2lts-mc(+0x60a8a) [0x55bd8f89ca8a]
18: pnml2lts-mc(+0x5eb15) [0x55bd8f89ab15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f94b12dad0a]
20: pnml2lts-mc(+0x6075e) [0x55bd8f89c75e]
ltl formula name PhilosophersDyn-COL-03-LTLFireability-05
ltl formula formula --ltl=/tmp/1480/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 30 places, 51 transitions and 321 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1480/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1480/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1480/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1480/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
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-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PhilosophersDyn-COL-03, 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 r297-tall-167873950200276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-COL-03 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 '
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 ;