About the Execution of LoLa+red for Philosophers-COL-000010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 386.172 | 14592.00 | 24150.00 | 324.70 | FFTFFFTFFFFFTTFT | 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.r295-tall-167873947400092.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 Philosophers-COL-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947400092
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.3K Feb 25 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 25 13:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 25 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 9.9K 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 Philosophers-COL-000010-LTLFireability-00
FORMULA_NAME Philosophers-COL-000010-LTLFireability-01
FORMULA_NAME Philosophers-COL-000010-LTLFireability-02
FORMULA_NAME Philosophers-COL-000010-LTLFireability-03
FORMULA_NAME Philosophers-COL-000010-LTLFireability-04
FORMULA_NAME Philosophers-COL-000010-LTLFireability-05
FORMULA_NAME Philosophers-COL-000010-LTLFireability-06
FORMULA_NAME Philosophers-COL-000010-LTLFireability-07
FORMULA_NAME Philosophers-COL-000010-LTLFireability-08
FORMULA_NAME Philosophers-COL-000010-LTLFireability-09
FORMULA_NAME Philosophers-COL-000010-LTLFireability-10
FORMULA_NAME Philosophers-COL-000010-LTLFireability-11
FORMULA_NAME Philosophers-COL-000010-LTLFireability-12
FORMULA_NAME Philosophers-COL-000010-LTLFireability-13
FORMULA_NAME Philosophers-COL-000010-LTLFireability-14
FORMULA_NAME Philosophers-COL-000010-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678782266058
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=Philosophers-COL-000010
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 08:24:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 08:24:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 08:24:27] [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 08:24:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 08:24:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 603 ms
[2023-03-14 08:24:28] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 50 PT places and 50.0 transition bindings in 14 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 08:24:28] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2023-03-14 08:24:28] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-000010-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 5 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 5294 steps, including 441 resets, run visited all 6 properties in 38 ms. (steps per millisecond=139 )
[2023-03-14 08:24:28] [INFO ] Flatten gal took : 12 ms
[2023-03-14 08:24:28] [INFO ] Flatten gal took : 1 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 10) 10) 10)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 08:24:28] [INFO ] Unfolded HLPN to a Petri net with 50 places and 50 transitions 160 arcs in 7 ms.
[2023-03-14 08:24:28] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-000010-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2023-03-14 08:24:28] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-14 08:24:28] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-14 08:24:28] [INFO ] Invariant cache hit.
[2023-03-14 08:24:28] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-14 08:24:28] [INFO ] Invariant cache hit.
[2023-03-14 08:24:28] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 302 ms. Remains : 50/50 places, 50/50 transitions.
Support contains 50 out of 50 places after structural reductions.
[2023-03-14 08:24:28] [INFO ] Flatten gal took : 9 ms
[2023-03-14 08:24:28] [INFO ] Flatten gal took : 10 ms
[2023-03-14 08:24:28] [INFO ] Input system was already deterministic with 50 transitions.
Finished random walk after 15 steps, including 0 resets, run visited all 14 properties in 3 ms. (steps per millisecond=5 )
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(G(p0))&&F(p1))))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-14 08:24:29] [INFO ] Invariant cache hit.
[2023-03-14 08:24:29] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-14 08:24:29] [INFO ] Invariant cache hit.
[2023-03-14 08:24:29] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-14 08:24:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 08:24:29] [INFO ] Invariant cache hit.
[2023-03-14 08:24:29] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 383 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000010-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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s17 1)) (AND (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s16 1)) (AND (GEQ s8 1) (GEQ s18 1)) (AND (GEQ s0 1) (GEQ s10 1)) (A...], 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 396 steps with 28 reset in 10 ms.
FORMULA Philosophers-COL-000010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-00 finished in 615 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(G(p0)) U (p1&&X(G(p0))))))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-14 08:24:29] [INFO ] Invariant cache hit.
[2023-03-14 08:24:29] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-14 08:24:29] [INFO ] Invariant cache hit.
[2023-03-14 08:24:29] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-14 08:24:29] [INFO ] Invariant cache hit.
[2023-03-14 08:24:30] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s11 1) (GEQ s21 1)) (AND (GEQ s15 1) (GEQ s25 1)) (AND (GEQ s19 1) (GEQ s29 1)) (AND (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s17 1) (GEQ s27 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-01 finished in 279 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 G((X(G(p1))||F(!p2)))))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-14 08:24:30] [INFO ] Invariant cache hit.
[2023-03-14 08:24:30] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-14 08:24:30] [INFO ] Invariant cache hit.
[2023-03-14 08:24:30] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-14 08:24:30] [INFO ] Invariant cache hit.
[2023-03-14 08:24:30] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p1) p2), p2, false]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=3 dest: 5}], [{ cond=p2, acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND p2 p0 p1), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p2 p0 p1), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s3 1) (GEQ s12 1)) (AND (GEQ s0 1) (GEQ s19 1)) (AND (GEQ s1 1) (GEQ s10 1)) (AND (GEQ s5 1) (GEQ s14 1)) (AND (GEQ s2 1) (GEQ s11 1)) (A...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8257 reset in 477 ms.
Product exploration explored 100000 steps with 8246 reset in 440 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 p0 (NOT p2) p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X p0), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 p0 p1)), (X (NOT (AND p2 p0 p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1))))]
Knowledge based reduction with 10 factoid took 926 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p1) p2), p2, false]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 08:24:32] [INFO ] Invariant cache hit.
[2023-03-14 08:24:33] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X p0), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (G (NOT (AND p2 (NOT p1)))), (G (NOT (AND p2 (NOT p1) p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 p0 p1)), (X (NOT (AND p2 p0 p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (F (AND p2 p1)), (F p2), (F (AND p2 p1 p0)), (F (NOT p0)), (F (AND p2 p0)), (F (AND p2 (NOT p0)))]
Property proved to be true thanks to knowledge :(G (NOT (AND p2 (NOT p1))))
Knowledge based reduction with 12 factoid took 855 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000010-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000010-LTLFireability-02 finished in 3737 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 20 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-14 08:24:33] [INFO ] Invariant cache hit.
[2023-03-14 08:24:33] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-14 08:24:33] [INFO ] Invariant cache hit.
[2023-03-14 08:24:34] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-14 08:24:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 08:24:34] [INFO ] Invariant cache hit.
[2023-03-14 08:24:34] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s11 1) (GEQ s21 1)) (AND (GEQ s15 1) (GEQ s25 1)) (AND (GEQ s19 1) (GEQ s29 1)) (AND (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s17 1) (GEQ s27 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 3 ms.
FORMULA Philosophers-COL-000010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-03 finished in 212 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 20 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-14 08:24:34] [INFO ] Invariant cache hit.
[2023-03-14 08:24:34] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-14 08:24:34] [INFO ] Invariant cache hit.
[2023-03-14 08:24:34] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-14 08:24:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 08:24:34] [INFO ] Invariant cache hit.
[2023-03-14 08:24:34] [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 136 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s11 1) (GEQ s21 1)) (AND (GEQ s15 1) (GEQ s25 1)) (AND (GEQ s19 1) (GEQ s29 1)) (AND (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s17 1) (GEQ s27 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-04 finished in 194 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(X(!p0))&&(X(G(!p0))||p1))))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-14 08:24:34] [INFO ] Invariant cache hit.
[2023-03-14 08:24:34] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-14 08:24:34] [INFO ] Invariant cache hit.
[2023-03-14 08:24:34] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-14 08:24:34] [INFO ] Invariant cache hit.
[2023-03-14 08:24:34] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 204 ms :[p0, p0, p0, p0, true, p0]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s17 1)) (AND (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s16 1)) (AND (GEQ s8 1) (GEQ s18 1)) (AND (GEQ s0 1) (GEQ s10 1)) (A...], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-05 finished in 366 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((G(p0)||F(p1)||G(p2)))))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-14 08:24:34] [INFO ] Invariant cache hit.
[2023-03-14 08:24:34] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-14 08:24:34] [INFO ] Invariant cache hit.
[2023-03-14 08:24:34] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-14 08:24:34] [INFO ] Invariant cache hit.
[2023-03-14 08:24:34] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 354 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(OR (AND (GEQ s7 1) (GEQ s17 1)) (AND (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s16 1)) (AND (GEQ s8 1) (GEQ s18 1)) (AND (GEQ s0 1) (GEQ s10 1)) (A...], 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]]
Product exploration explored 100000 steps with 33333 reset in 249 ms.
Product exploration explored 100000 steps with 33333 reset in 271 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 p1 (NOT p2) (NOT p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p0 (NOT p1) (NOT p2)))))
Knowledge based reduction with 5 factoid took 155 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000010-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000010-LTLFireability-06 finished in 1203 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&&F((p1&&X(p2)))))))'
Support contains 40 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-14 08:24:35] [INFO ] Invariant cache hit.
[2023-03-14 08:24:35] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-14 08:24:35] [INFO ] Invariant cache hit.
[2023-03-14 08:24:35] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-14 08:24:35] [INFO ] Invariant cache hit.
[2023-03-14 08:24:36] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (AND (GEQ s3 1) (GEQ s12 1)) (AND (GEQ s0 1) (GEQ s19 1)) (AND (GEQ s1 1) (GEQ s10 1)) (AND (GEQ s5 1) (GEQ s14 1)) (AND (GEQ s2 1) (GEQ s11 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1196 steps with 158 reset in 7 ms.
FORMULA Philosophers-COL-000010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-08 finished in 337 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 (p1||G(!p0)))))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-14 08:24:36] [INFO ] Invariant cache hit.
[2023-03-14 08:24:36] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-14 08:24:36] [INFO ] Invariant cache hit.
[2023-03-14 08:24:36] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-14 08:24:36] [INFO ] Invariant cache hit.
[2023-03-14 08:24:36] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NOT (OR (AND (GEQ s19 1) (GEQ s30 1)) (AND (GEQ s13 1) (GEQ s34 1)) (AND (GEQ s16 1) (GEQ s37 1)) (AND (GEQ s17 1) (GEQ s38 1)) (AND (GEQ s12 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-09 finished in 214 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(X(F(X((X(p0) U p1))))))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-14 08:24:36] [INFO ] Invariant cache hit.
[2023-03-14 08:24:36] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-14 08:24:36] [INFO ] Invariant cache hit.
[2023-03-14 08:24:36] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-14 08:24:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 08:24:36] [INFO ] Invariant cache hit.
[2023-03-14 08:24:36] [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 132 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s49 1) (GEQ s48 1) (GEQ s41 1) (GEQ s40 1) (GEQ s43 1) (GEQ s42 1) (GEQ s45 1) (GEQ s44 1) (GEQ s47 1) (GEQ s46 1) (AND (GEQ s19 1) (GEQ s30 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 94 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000010-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-10 finished in 214 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(p2)))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-14 08:24:36] [INFO ] Invariant cache hit.
[2023-03-14 08:24:36] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-14 08:24:36] [INFO ] Invariant cache hit.
[2023-03-14 08:24:36] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-14 08:24:36] [INFO ] Invariant cache hit.
[2023-03-14 08:24:36] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(OR (GEQ s49 1) (GEQ s48 1) (GEQ s41 1) (GEQ s40 1) (GEQ s43 1) (GEQ s42 1) (GEQ s45 1) (GEQ s44 1) (GEQ s47 1) (GEQ s46 1) (AND (GEQ s3 1) (GEQ s12 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 242 ms.
Product exploration explored 100000 steps with 50000 reset in 242 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 p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 6 factoid took 140 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000010-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000010-LTLFireability-12 finished in 972 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(p0) U (X(p2)||p1)))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-14 08:24:37] [INFO ] Invariant cache hit.
[2023-03-14 08:24:37] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-14 08:24:37] [INFO ] Invariant cache hit.
[2023-03-14 08:24:37] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-14 08:24:37] [INFO ] Invariant cache hit.
[2023-03-14 08:24:37] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s49 1) (GEQ s48 1) (GEQ s41 1) (GEQ s40 1) (GEQ s43 1) (GEQ s42 1) (GEQ s45 1) (GEQ s44 1) (GEQ s47 1) (GEQ s46 1)), p0:(AND (OR (AND (GEQ s7 ...], nbAcceptance=0, 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]]
Product exploration explored 100000 steps with 50000 reset in 300 ms.
Product exploration explored 100000 steps with 50000 reset in 267 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) (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 7 factoid took 192 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000010-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000010-LTLFireability-13 finished in 1056 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 20 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-14 08:24:38] [INFO ] Invariant cache hit.
[2023-03-14 08:24:38] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-14 08:24:38] [INFO ] Invariant cache hit.
[2023-03-14 08:24:38] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-14 08:24:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 08:24:38] [INFO ] Invariant cache hit.
[2023-03-14 08:24:38] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000010-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:(OR (AND (GEQ s7 1) (GEQ s17 1)) (AND (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s16 1)) (AND (GEQ s8 1) (GEQ s18 1)) (AND (GEQ s0 1) (GEQ s10 1)) (A...], 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 2148 steps with 114 reset in 8 ms.
FORMULA Philosophers-COL-000010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-14 finished in 215 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(G(!p1))||p0))))'
Support contains 40 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-14 08:24:38] [INFO ] Invariant cache hit.
[2023-03-14 08:24:38] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-14 08:24:38] [INFO ] Invariant cache hit.
[2023-03-14 08:24:38] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-14 08:24:38] [INFO ] Invariant cache hit.
[2023-03-14 08:24:38] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (OR (LT s19 1) (LT s30 1)) (OR (LT s13 1) (LT s34 1)) (OR (LT s16 1) (LT s37 1)) (OR (LT s17 1) (LT s38 1)) (OR (LT s12 1) (LT s33 1)) (OR (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 174 ms.
Product exploration explored 100000 steps with 33333 reset in 176 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 p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 57 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000010-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000010-LTLFireability-15 finished in 686 ms.
All properties solved by simple procedures.
Total runtime 12079 ms.
ITS solved all properties within timeout
BK_STOP 1678782280650
--------------------
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
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="Philosophers-COL-000010"
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 Philosophers-COL-000010, 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-167873947400092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000010.tgz
mv Philosophers-COL-000010 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 ;