About the Execution of ITS-Tools for Philosophers-COL-000005
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 355.384 | 12482.00 | 19091.00 | 1210.00 | FFTFTFFFFFFFTFFF | 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.r293-tall-167873944900084.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 itstools
Input is Philosophers-COL-000005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873944900084
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.0K Feb 25 13:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Feb 25 13:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 13:06 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 25K 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 12K Feb 25 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 13:06 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.7K 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-000005-LTLFireability-00
FORMULA_NAME Philosophers-COL-000005-LTLFireability-01
FORMULA_NAME Philosophers-COL-000005-LTLFireability-02
FORMULA_NAME Philosophers-COL-000005-LTLFireability-03
FORMULA_NAME Philosophers-COL-000005-LTLFireability-04
FORMULA_NAME Philosophers-COL-000005-LTLFireability-05
FORMULA_NAME Philosophers-COL-000005-LTLFireability-06
FORMULA_NAME Philosophers-COL-000005-LTLFireability-07
FORMULA_NAME Philosophers-COL-000005-LTLFireability-08
FORMULA_NAME Philosophers-COL-000005-LTLFireability-09
FORMULA_NAME Philosophers-COL-000005-LTLFireability-10
FORMULA_NAME Philosophers-COL-000005-LTLFireability-11
FORMULA_NAME Philosophers-COL-000005-LTLFireability-12
FORMULA_NAME Philosophers-COL-000005-LTLFireability-13
FORMULA_NAME Philosophers-COL-000005-LTLFireability-14
FORMULA_NAME Philosophers-COL-000005-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678787320632
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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000005
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-14 09:48:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 09:48:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:48:42] [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 09:48:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 09:48:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 406 ms
[2023-03-14 09:48:42] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 25 PT places and 25.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 09:48:42] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 4 ms.
[2023-03-14 09:48:42] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-COL-000005-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 6 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 380 steps, including 54 resets, run visited all 4 properties in 12 ms. (steps per millisecond=31 )
[2023-03-14 09:48:42] [INFO ] Flatten gal took : 12 ms
[2023-03-14 09:48:42] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 5) 5) 5)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 09:48:42] [INFO ] Unfolded HLPN to a Petri net with 25 places and 25 transitions 80 arcs in 7 ms.
[2023-03-14 09:48:42] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-000005-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 6 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2023-03-14 09:48:42] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-14 09:48:43] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-14 09:48:43] [INFO ] Invariant cache hit.
[2023-03-14 09:48:43] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-14 09:48:43] [INFO ] Invariant cache hit.
[2023-03-14 09:48:43] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 25/25 places, 25/25 transitions.
Support contains 25 out of 25 places after structural reductions.
[2023-03-14 09:48:43] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:48:43] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:48:43] [INFO ] Input system was already deterministic with 25 transitions.
Finished random walk after 13 steps, including 0 resets, run visited all 7 properties in 3 ms. (steps per millisecond=4 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:43] [INFO ] Invariant cache hit.
[2023-03-14 09:48:43] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-14 09:48:43] [INFO ] Invariant cache hit.
[2023-03-14 09:48:43] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-14 09:48:43] [INFO ] Invariant cache hit.
[2023-03-14 09:48:43] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 1297 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s4 1) (LT s8 1)) (OR (LT s1 1) (LT s5 1)) (OR (LT s3 1) (LT s7 1)) (OR (LT s2 1) (LT s6 1)) (OR (LT s0 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 1 steps with 0 reset in 2 ms.
FORMULA Philosophers-COL-000005-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-00 finished in 1462 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||X(X(F(p1)))))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:44] [INFO ] Invariant cache hit.
[2023-03-14 09:48:44] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-14 09:48:44] [INFO ] Invariant cache hit.
[2023-03-14 09:48:44] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-14 09:48:44] [INFO ] Invariant cache hit.
[2023-03-14 09:48:45] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s4 1) (GEQ s9 1)) (AND (GEQ s1 1) (GEQ s6 1)) (AND (GEQ s3 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s7 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][false, false, false, false]]
Product exploration explored 100000 steps with 25807 reset in 249 ms.
Product exploration explored 100000 steps with 25782 reset in 166 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) p1), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 19 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:46] [INFO ] Invariant cache hit.
[2023-03-14 09:48:46] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-14 09:48:46] [INFO ] Invariant cache hit.
[2023-03-14 09:48:46] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-14 09:48:46] [INFO ] Invariant cache hit.
[2023-03-14 09:48:46] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 25/25 places, 25/25 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 (NOT p0) p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 139 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25812 reset in 121 ms.
Product exploration explored 100000 steps with 25806 reset in 182 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 8 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 09:48:48] [INFO ] Invariant cache hit.
[2023-03-14 09:48:48] [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 50 ms. Remains : 25/25 places, 25/25 transitions.
Built C files in :
/tmp/ltsmin1795826758974109244
[2023-03-14 09:48:48] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1795826758974109244
Running compilation step : cd /tmp/ltsmin1795826758974109244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 198 ms.
Running link step : cd /tmp/ltsmin1795826758974109244;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1795826758974109244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15187734579347843344.hoa' '--buchi-type=spotba'
LTSmin run took 174 ms.
FORMULA Philosophers-COL-000005-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Philosophers-COL-000005-LTLFireability-04 finished in 3685 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&&(p1 U p2)))))'
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:48] [INFO ] Invariant cache hit.
[2023-03-14 09:48:48] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-14 09:48:48] [INFO ] Invariant cache hit.
[2023-03-14 09:48:48] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-14 09:48:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 09:48:48] [INFO ] Invariant cache hit.
[2023-03-14 09:48:48] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 628 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (NOT p2)]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p0 (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR p0 (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s20 1) (LT s21 1) (LT s22 1) (LT s23 1) (LT s24 1)), p2:(AND (OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s4 1) (GEQ s9 1)) (AND (GEQ s1 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 210 steps with 23 reset in 4 ms.
FORMULA Philosophers-COL-000005-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-05 finished in 779 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)||(G(!p1)&&F(p2))))'
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:49] [INFO ] Invariant cache hit.
[2023-03-14 09:48:49] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-14 09:48:49] [INFO ] Invariant cache hit.
[2023-03-14 09:48:49] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-14 09:48:49] [INFO ] Invariant cache hit.
[2023-03-14 09:48:49] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND p1 (NOT p0)), p1, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1)]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 3}], [{ cond=p1, acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s18 1)) (AND (GEQ s5 1) (GEQ s16 1)) (AND (GEQ s9 1) (GEQ s15 1)) (AND (GEQ s6 1) (GEQ s17 1)) (AND (GEQ s8 1) (GEQ s19 1))), ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 2 reset in 0 ms.
FORMULA Philosophers-COL-000005-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-06 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' '!(F(G((F(!p0)||X(!p1)))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:49] [INFO ] Invariant cache hit.
[2023-03-14 09:48:49] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-14 09:48:49] [INFO ] Invariant cache hit.
[2023-03-14 09:48:49] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-14 09:48:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 09:48:49] [INFO ] Invariant cache hit.
[2023-03-14 09:48:49] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND p1 p0), (AND p1 p0)]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s8 1) (GEQ s13 1)) (AND (GEQ s9 1) (GEQ s14 1)) (AND (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s6 1) (GEQ s11 1)) (AND (GEQ s7 1) (GEQ s12 1))), ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9763 reset in 183 ms.
Stack based approach found an accepted trace after 1182 steps with 122 reset with depth 7 and stack size 7 in 4 ms.
FORMULA Philosophers-COL-000005-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-07 finished in 424 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&&(F(p1)||X(p2))))))'
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:50] [INFO ] Invariant cache hit.
[2023-03-14 09:48:50] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-14 09:48:50] [INFO ] Invariant cache hit.
[2023-03-14 09:48:50] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-14 09:48:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 09:48:50] [INFO ] Invariant cache hit.
[2023-03-14 09:48:50] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1)))]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s4 1) (LT s8 1)) (OR (LT s1 1) (LT s5 1)) (OR (LT s3 1) (LT s7 1)) (OR (LT s2 1) (LT s6 1)) (OR (LT s0 1) (LT s9 1))), p1:(AND (LT s20 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 22 steps with 1 reset in 0 ms.
FORMULA Philosophers-COL-000005-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-08 finished in 282 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 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:50] [INFO ] Invariant cache hit.
[2023-03-14 09:48:50] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-14 09:48:50] [INFO ] Invariant cache hit.
[2023-03-14 09:48:50] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-14 09:48:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 09:48:50] [INFO ] Invariant cache hit.
[2023-03-14 09:48:50] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 32 ms :[p0]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s20 1) (LT s21 1) (LT s22 1) (LT s23 1) (LT s24 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 26 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000005-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-09 finished in 183 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 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 5 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:50] [INFO ] Invariant cache hit.
[2023-03-14 09:48:50] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-14 09:48:50] [INFO ] Invariant cache hit.
[2023-03-14 09:48:50] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-14 09:48:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 09:48:50] [INFO ] Invariant cache hit.
[2023-03-14 09:48:50] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) p1), p1, p1, (NOT p0)]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-10 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:(OR (AND (GEQ s7 1) (GEQ s18 1)) (AND (GEQ s5 1) (GEQ s16 1)) (AND (GEQ s9 1) (GEQ s15 1)) (AND (GEQ s6 1) (GEQ s17 1)) (AND (GEQ s8 1) (GEQ s19 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]]
Product exploration explored 100000 steps with 12653 reset in 213 ms.
Stack based approach found an accepted trace after 28 steps with 3 reset with depth 6 and stack size 6 in 0 ms.
FORMULA Philosophers-COL-000005-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-10 finished in 521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:51] [INFO ] Invariant cache hit.
[2023-03-14 09:48:51] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-14 09:48:51] [INFO ] Invariant cache hit.
[2023-03-14 09:48:51] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-14 09:48:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 09:48:51] [INFO ] Invariant cache hit.
[2023-03-14 09:48:51] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 31 ms :[p0]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s18 1)) (AND (GEQ s5 1) (GEQ s16 1)) (AND (GEQ s9 1) (GEQ s15 1)) (AND (GEQ s6 1) (GEQ s17 1)) (AND (GEQ s8 1) (GEQ s19 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 2781 reset in 168 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 17 in 0 ms.
FORMULA Philosophers-COL-000005-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-11 finished in 320 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)))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:51] [INFO ] Invariant cache hit.
[2023-03-14 09:48:51] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-14 09:48:51] [INFO ] Invariant cache hit.
[2023-03-14 09:48:51] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-14 09:48:51] [INFO ] Invariant cache hit.
[2023-03-14 09:48:51] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s20 1) (LT s21 1) (LT s22 1) (LT s23 1) (LT s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 5 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000005-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-13 finished in 202 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&&F(G(p0)))))'
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:51] [INFO ] Invariant cache hit.
[2023-03-14 09:48:51] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-14 09:48:51] [INFO ] Invariant cache hit.
[2023-03-14 09:48:51] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-14 09:48:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 09:48:51] [INFO ] Invariant cache hit.
[2023-03-14 09:48:51] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-14 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 s8 1) (GEQ s13 1)) (AND (GEQ s9 1) (GEQ s14 1)) (AND (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s6 1) (GEQ s11 1)) (AND (GEQ s7 1) (GEQ s12 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 29 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000005-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-14 finished in 159 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 X((!p1&&G(p0)))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:51] [INFO ] Invariant cache hit.
[2023-03-14 09:48:51] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-14 09:48:51] [INFO ] Invariant cache hit.
[2023-03-14 09:48:51] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-14 09:48:51] [INFO ] Invariant cache hit.
[2023-03-14 09:48:51] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s13 1)) (AND (GEQ s9 1) (GEQ s14 1)) (AND (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s6 1) (GEQ s11 1)) (AND (GEQ s7 1) (GEQ s12 1))), ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000005-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-15 finished in 331 ms.
All properties solved by simple procedures.
Total runtime 9999 ms.
BK_STOP 1678787333114
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-000005"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Philosophers-COL-000005, 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 r293-tall-167873944900084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000005.tgz
mv Philosophers-COL-000005 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 ;