Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089267800045.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PhilosophersDyn-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089267800045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 30K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 172K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 56K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 299K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.0K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 27 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 25 11:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 25 11:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 87K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621179231210

Running Version 0
[2021-05-16 15:33:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 15:33:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 15:33:54] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2021-05-16 15:33:54] [INFO ] Transformed 30 places.
[2021-05-16 15:33:54] [INFO ] Transformed 84 transitions.
[2021-05-16 15:33:54] [INFO ] Parsed PT model containing 30 places and 84 transitions in 73 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 15:33:54] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-16 15:33:54] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-16 15:33:54] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-16 15:33:54] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-16 15:33:54] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-16 15:33:54] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-16 15:33:54] [INFO ] Initial state test concluded for 5 properties.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
FORMULA PhilosophersDyn-PT-03-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 17 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2021-05-16 15:33:54] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2021-05-16 15:33:54] [INFO ] Computed 11 place invariants in 18 ms
[2021-05-16 15:33:54] [INFO ] Dead Transitions using invariants and state equation in 223 ms returned [0, 6, 7, 8, 12, 13, 15, 16, 19, 20, 21, 22, 23, 24, 26, 28, 39, 44, 45, 48, 53, 55, 56, 61, 64, 66, 71, 72, 74, 75]
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions :[75, 74, 72, 71, 66, 64, 61, 56, 55, 53, 48, 45, 44, 39, 28, 26, 24, 23, 22, 21, 20, 19, 16, 15, 13, 12, 8, 7, 6, 0]
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:54] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 15:33:54] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:54] [INFO ] Computed 11 place invariants in 5 ms
[2021-05-16 15:33:54] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:54] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:54] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-16 15:33:54] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Starting structural reductions, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:54] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:55] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/30 places, 51/81 transitions.
[2021-05-16 15:33:55] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 15:33:55] [INFO ] Flatten gal took : 49 ms
FORMULA PhilosophersDyn-PT-03-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 15:33:55] [INFO ] Flatten gal took : 19 ms
[2021-05-16 15:33:55] [INFO ] Input system was already deterministic with 51 transitions.
Finished random walk after 38 steps, including 4 resets, run visited all 16 properties in 13 ms. (steps per millisecond=2 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X((!p1&&X((G(p1)&&F(G(p2))))))||p0)))], workingDir=/home/mcc/execution]
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:55] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:55] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:55] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:55] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:55] [INFO ] Computed 11 place invariants in 10 ms
[2021-05-16 15:33:55] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:55] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:55] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:56] [INFO ] Dead Transitions using invariants and state equation in 500 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PhilosophersDyn-PT-03-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s6 1) (GEQ s9 1) (GEQ s12 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s22 1)) (AND (GEQ s4 1) (GEQ s21 1) (GEQ s27 1)) (AND (GEQ s12 1) (GEQ s21 1) (GEQ s25 1)) (AND (GEQ s14 1) (GEQ s15 1) (GEQ s21 1)) (AND (GEQ s9 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s5 1) (GEQ s12 1)) (AND (GEQ s4 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s4 1) (GEQ s5 1) (GEQ s16 1))), p1:(AND (OR (LT s6 1) (LT s9 1) (LT s12 1)) (OR (LT s5 1) (LT s14 1) (LT s22 1)) (OR (LT s4 1) (LT s21 1) (LT s27 1)) (OR (LT s12 1) (LT s21 1) (LT s25 1)) (OR (LT s14 1) (LT s15 1) (LT s21 1)) (OR (LT s9 1) (LT s14 1) (LT s17 1)) (OR (LT s0 1) (LT s5 1) (LT s12 1)) (OR (LT s4 1) (LT s9 1) (LT s19 1)) (OR (LT s4 1) (LT s5 1) (LT s16 1))), p2:(AND (OR (LT s4 1) (LT s10 1) (LT s16 1) (LT s19 1)) (OR (LT s3 1) (LT s14 1) (LT s15 1) (LT s25 1)) (OR (LT s4 1) (LT s10 1) (LT s16 2)) (OR (LT s3 1) (LT s14 1) (LT s15 1) (LT s27 1)) (OR (LT s4 1) (LT s10 1) (LT s16 1) (LT s22 1)) (OR (LT s0 1) (LT s4 1) (LT s10 1) (LT s19 1)) (OR (LT s4 1) (LT s10 1) (LT s16 1) (LT s27 1)) (OR (LT s3 1) (LT s14 1) (LT s15 1) (LT s17 1)) (OR (LT s7 1) (LT s12 1) (LT s19 1) (LT s25 1)) (OR (LT s3 1) (LT s14 1) (LT s15 1) (LT s22 1)) (OR (LT s0 1) (LT s4 1) (LT s10 1) (LT s27 1)) (OR (LT s0 1) (LT s7 1) (LT s12 1) (LT s17 1)) (OR (LT s0 1) (LT s6 1) (LT s7 1) (LT s12 1)) (OR (LT s0 1) (LT s7 1) (LT s12 1) (LT s19 1)) (OR (LT s3 1) (LT s14 1) (LT s22 1) (LT s27 1)) (OR (LT s3 1) (LT s14 1) (LT s22 1) (LT s25 1)) (OR (LT s6 1) (LT s7 1) (LT s12 1) (LT s19 1)) (OR (LT s7 1) (LT s12 1) (LT s17 1) (LT s25 1)) (OR (LT s6 1) (LT s7 1) (LT s12 1) (LT s17 1)) (OR (LT s3 1) (LT s14 1) (LT s17 1) (LT s27 1)) (OR (LT s6 2) (LT s7 1) (LT s12 1)) (OR (LT s4 1) (LT s10 1) (LT s19 1) (LT s22 1)) (OR (LT s3 1) (LT s14 1) (LT s17 1) (LT s25 1)) (OR (LT s3 1) (LT s14 1) (LT s15 2)) (OR (LT s0 1) (LT s4 1) (LT s10 1) (LT s16 1)) (OR (LT s4 1) (LT s10 1) (LT s22 1) (LT s27 1)) (OR (LT s6 1) (LT s7 1) (LT s12 1) (LT s25 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 32 steps with 8 reset in 2 ms.
FORMULA PhilosophersDyn-PT-03-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-00 finished in 1141 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 74 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:56] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:56] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:56] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 15:33:56] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:56] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:56] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2021-05-16 15:33:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:56] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 15:33:56] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s24 1)) (AND (GEQ s14 1) (GEQ s20 1)) (AND (GEQ s1 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 7 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-03-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-01 finished in 350 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:57] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 15:33:57] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:57] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:57] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:57] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 15:33:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:57] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:57] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:57] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s28 1) (GEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-03-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-02 finished in 275 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:57] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:57] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:57] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:57] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:57] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 15:33:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:57] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2021-05-16 15:33:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:57] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:57] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s24 1)) (AND (GEQ s14 1) (GEQ s20 1)) (AND (GEQ s1 1) (GEQ s12 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 31 steps with 7 reset in 1 ms.
FORMULA PhilosophersDyn-PT-03-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-03 finished in 406 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(p1))))], workingDir=/home/mcc/execution]
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:57] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 15:33:57] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:57] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:57] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:57] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:57] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:57] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:58] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-PT-03-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s4 1) (LT s10 1) (LT s16 1) (LT s19 1)) (OR (LT s3 1) (LT s14 1) (LT s15 1) (LT s25 1)) (OR (LT s4 1) (LT s10 1) (LT s16 2)) (OR (LT s3 1) (LT s14 1) (LT s15 1) (LT s27 1)) (OR (LT s4 1) (LT s10 1) (LT s16 1) (LT s22 1)) (OR (LT s0 1) (LT s4 1) (LT s10 1) (LT s19 1)) (OR (LT s4 1) (LT s10 1) (LT s16 1) (LT s27 1)) (OR (LT s3 1) (LT s14 1) (LT s15 1) (LT s17 1)) (OR (LT s7 1) (LT s12 1) (LT s19 1) (LT s25 1)) (OR (LT s3 1) (LT s14 1) (LT s15 1) (LT s22 1)) (OR (LT s0 1) (LT s4 1) (LT s10 1) (LT s27 1)) (OR (LT s0 1) (LT s7 1) (LT s12 1) (LT s17 1)) (OR (LT s0 1) (LT s6 1) (LT s7 1) (LT s12 1)) (OR (LT s0 1) (LT s7 1) (LT s12 1) (LT s19 1)) (OR (LT s3 1) (LT s14 1) (LT s22 1) (LT s27 1)) (OR (LT s3 1) (LT s14 1) (LT s22 1) (LT s25 1)) (OR (LT s6 1) (LT s7 1) (LT s12 1) (LT s19 1)) (OR (LT s7 1) (LT s12 1) (LT s17 1) (LT s25 1)) (OR (LT s6 1) (LT s7 1) (LT s12 1) (LT s17 1)) (OR (LT s3 1) (LT s14 1) (LT s17 1) (LT s27 1)) (OR (LT s6 2) (LT s7 1) (LT s12 1)) (OR (LT s4 1) (LT s10 1) (LT s19 1) (LT s22 1)) (OR (LT s3 1) (LT s14 1) (LT s17 1) (LT s25 1)) (OR (LT s3 1) (LT s14 1) (LT s15 2)) (OR (LT s0 1) (LT s4 1) (LT s10 1) (LT s16 1)) (OR (LT s4 1) (LT s10 1) (LT s22 1) (LT s27 1)) (OR (LT s6 1) (LT s7 1) (LT s12 1) (LT s25 1))), p0:(AND (OR (LT s6 1) (LT s9 1) (LT s12 1)) (OR (LT s5 1) (LT s14 1) (LT s22 1)) (OR (LT s4 1) (LT s21 1) (LT s27 1)) (OR (LT s12 1) (LT s21 1) (LT s25 1)) (OR (LT s14 1) (LT s15 1) (LT s21 1)) (OR (LT s9 1) (LT s14 1) (LT s17 1)) (OR (LT s0 1) (LT s5 1) (LT s12 1)) (OR (LT s4 1) (LT s9 1) (LT s19 1)) (OR (LT s4 1) (LT s5 1) (LT s16 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 301 ms.
Product exploration explored 100000 steps with 50000 reset in 223 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Product exploration explored 100000 steps with 50000 reset in 230 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 18 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:59] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:34:00] [INFO ] Dead Transitions using invariants and state equation in 446 ms returned []
[2021-05-16 15:34:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:00] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:34:00] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Product exploration explored 100000 steps with 50000 reset in 384 ms.
Product exploration explored 100000 steps with 50000 reset in 465 ms.
[2021-05-16 15:34:01] [INFO ] Flatten gal took : 6 ms
[2021-05-16 15:34:01] [INFO ] Flatten gal took : 18 ms
[2021-05-16 15:34:01] [INFO ] Time to serialize gal into /tmp/LTL13412489204486880165.gal : 15 ms
[2021-05-16 15:34:01] [INFO ] Time to serialize properties into /tmp/LTL7580728381327853387.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13412489204486880165.gal, -t, CGAL, -LTL, /tmp/LTL7580728381327853387.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13412489204486880165.gal -t CGAL -LTL /tmp/LTL7580728381327853387.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("((((((((((((((((((((((((((((((Forks_1<1)||(Think_1<1))||(Neighbourhood_1_1<1))||(Neighbourhood_2_1<1))&&((((Think_3<1)||(Forks_3<1))||(Neighbourhood_3_3<1))||(Neighbourhood_3_2<1)))&&(((Forks_1<1)||(Think_1<1))||(Neighbourhood_1_1<2)))&&((((Think_3<1)||(Forks_3<1))||(Neighbourhood_3_3<1))||(Neighbourhood_3_1<1)))&&((((Forks_1<1)||(Think_1<1))||(Neighbourhood_1_1<1))||(Neighbourhood_1_3<1)))&&((((Neighbourhood_1_2<1)||(Forks_1<1))||(Think_1<1))||(Neighbourhood_2_1<1)))&&((((Forks_1<1)||(Think_1<1))||(Neighbourhood_1_1<1))||(Neighbourhood_3_1<1)))&&((((Think_3<1)||(Forks_3<1))||(Neighbourhood_3_3<1))||(Neighbourhood_2_3<1)))&&((((Think_2<1)||(Forks_2<1))||(Neighbourhood_2_1<1))||(Neighbourhood_3_2<1)))&&((((Think_3<1)||(Forks_3<1))||(Neighbourhood_3_3<1))||(Neighbourhood_1_3<1)))&&((((Neighbourhood_1_2<1)||(Forks_1<1))||(Think_1<1))||(Neighbourhood_3_1<1)))&&((((Neighbourhood_1_2<1)||(Think_2<1))||(Forks_2<1))||(Neighbourhood_2_3<1)))&&((((Neighbourhood_1_2<1)||(Neighbourhood_2_2<1))||(Think_2<1))||(Forks_2<1)))&&((((Neighbourhood_1_2<1)||(Think_2<1))||(Forks_2<1))||(Neighbourhood_2_1<1)))&&((((Think_3<1)||(Forks_3<1))||(Neighbourhood_1_3<1))||(Neighbourhood_3_1<1)))&&((((Think_3<1)||(Forks_3<1))||(Neighbourhood_1_3<1))||(Neighbourhood_3_2<1)))&&((((Neighbourhood_2_2<1)||(Think_2<1))||(Forks_2<1))||(Neighbourhood_2_1<1)))&&((((Think_2<1)||(Forks_2<1))||(Neighbourhood_2_3<1))||(Neighbourhood_3_2<1)))&&((((Neighbourhood_2_2<1)||(Think_2<1))||(Forks_2<1))||(Neighbourhood_2_3<1)))&&((((Think_3<1)||(Forks_3<1))||(Neighbourhood_2_3<1))||(Neighbourhood_3_1<1)))&&(((Neighbourhood_2_2<2)||(Think_2<1))||(Forks_2<1)))&&((((Forks_1<1)||(Think_1<1))||(Neighbourhood_2_1<1))||(Neighbourhood_1_3<1)))&&((((Think_3<1)||(Forks_3<1))||(Neighbourhood_2_3<1))||(Neighbourhood_3_2<1)))&&(((Think_3<1)||(Forks_3<1))||(Neighbourhood_3_3<2)))&&((((Neighbourhood_1_2<1)||(Forks_1<1))||(Think_1<1))||(Neighbourhood_1_1<1)))&&((((Forks_1<1)||(Think_1<1))||(Neighbourhood_1_3<1))||(Neighbourhood_3_1<1)))&&((((Neighbourhood_2_2<1)||(Think_2<1))||(Forks_2<1))||(Neighbourhood_3_2<1)))"))||("(((((((((((Neighbourhood_2_2<1)||(WaitRight_2<1))||(Forks_2<1))&&(((WaitRight_1<1)||(Forks_3<1))||(Neighbourhood_1_3<1)))&&(((Forks_1<1)||(WaitRight_3<1))||(Neighbourhood_3_1<1)))&&(((Forks_2<1)||(WaitRight_3<1))||(Neighbourhood_3_2<1)))&&(((Forks_3<1)||(Neighbourhood_3_3<1))||(WaitRight_3<1)))&&(((WaitRight_2<1)||(Forks_3<1))||(Neighbourhood_2_3<1)))&&(((Neighbourhood_1_2<1)||(WaitRight_1<1))||(Forks_2<1)))&&(((Forks_1<1)||(WaitRight_2<1))||(Neighbourhood_2_1<1)))&&(((Forks_1<1)||(WaitRight_1<1))||(Neighbourhood_1_1<1)))"))))
Formula 0 simplified : !X("(((((((((((Neighbourhood_2_2<1)||(WaitRight_2<1))||(Forks_2<1))&&(((WaitRight_1<1)||(Forks_3<1))||(Neighbourhood_1_3<1)))&&(((Forks_1<1)||(WaitRight_3<1))||(Neighbourhood_3_1<1)))&&(((Forks_2<1)||(WaitRight_3<1))||(Neighbourhood_3_2<1)))&&(((Forks_3<1)||(Neighbourhood_3_3<1))||(WaitRight_3<1)))&&(((WaitRight_2<1)||(Forks_3<1))||(Neighbourhood_2_3<1)))&&(((Neighbourhood_1_2<1)||(WaitRight_1<1))||(Forks_2<1)))&&(((Forks_1<1)||(WaitRight_2<1))||(Neighbourhood_2_1<1)))&&(((Forks_1<1)||(WaitRight_1<1))||(Neighbourhood_1_1<1)))" | F"((((((((((((((((((((((((((((((Forks_1<1)||(Think_1<1))||(Neighbourhood_1_1<1))||(Neighbourhood_2_1<1))&&((((Think_3<1)||(Forks_3<1))||(Neighbourhood_3_3<1))||(Neighbourhood_3_2<1)))&&(((Forks_1<1)||(Think_1<1))||(Neighbourhood_1_1<2)))&&((((Think_3<1)||(Forks_3<1))||(Neighbourhood_3_3<1))||(Neighbourhood_3_1<1)))&&((((Forks_1<1)||(Think_1<1))||(Neighbourhood_1_1<1))||(Neighbourhood_1_3<1)))&&((((Neighbourhood_1_2<1)||(Forks_1<1))||(Think_1<1))||(Neighbourhood_2_1<1)))&&((((Forks_1<1)||(Think_1<1))||(Neighbourhood_1_1<1))||(Neighbourhood_3_1<1)))&&((((Think_3<1)||(Forks_3<1))||(Neighbourhood_3_3<1))||(Neighbourhood_2_3<1)))&&((((Think_2<1)||(Forks_2<1))||(Neighbourhood_2_1<1))||(Neighbourhood_3_2<1)))&&((((Think_3<1)||(Forks_3<1))||(Neighbourhood_3_3<1))||(Neighbourhood_1_3<1)))&&((((Neighbourhood_1_2<1)||(Forks_1<1))||(Think_1<1))||(Neighbourhood_3_1<1)))&&((((Neighbourhood_1_2<1)||(Think_2<1))||(Forks_2<1))||(Neighbourhood_2_3<1)))&&((((Neighbourhood_1_2<1)||(Neighbourhood_2_2<1))||(Think_2<1))||(Forks_2<1)))&&((((Neighbourhood_1_2<1)||(Think_2<1))||(Forks_2<1))||(Neighbourhood_2_1<1)))&&((((Think_3<1)||(Forks_3<1))||(Neighbourhood_1_3<1))||(Neighbourhood_3_1<1)))&&((((Think_3<1)||(Forks_3<1))||(Neighbourhood_1_3<1))||(Neighbourhood_3_2<1)))&&((((Neighbourhood_2_2<1)||(Think_2<1))||(Forks_2<1))||(Neighbourhood_2_1<1)))&&((((Think_2<1)||(Forks_2<1))||(Neighbourhood_2_3<1))||(Neighbourhood_3_2<1)))&&((((Neighbourhood_2_2<1)||(Think_2<1))||(Forks_2<1))||(Neighbourhood_2_3<1)))&&((((Think_3<1)||(Forks_3<1))||(Neighbourhood_2_3<1))||(Neighbourhood_3_1<1)))&&(((Neighbourhood_2_2<2)||(Think_2<1))||(Forks_2<1)))&&((((Forks_1<1)||(Think_1<1))||(Neighbourhood_2_1<1))||(Neighbourhood_1_3<1)))&&((((Think_3<1)||(Forks_3<1))||(Neighbourhood_2_3<1))||(Neighbourhood_3_2<1)))&&(((Think_3<1)||(Forks_3<1))||(Neighbourhood_3_3<2)))&&((((Neighbourhood_1_2<1)||(Forks_1<1))||(Think_1<1))||(Neighbourhood_1_1<1)))&&((((Forks_1<1)||(Think_1<1))||(Neighbourhood_1_3<1))||(Neighbourhood_3_1<1)))&&((((Neighbourhood_2_2<1)||(Think_2<1))||(Forks_2<1))||(Neighbourhood_3_2<1)))")
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t12, t15, t17, t21, t32, t34, t35, t36, t44, t49, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :9/30/12/51
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.096059,19736,1,0,99,11739,117,42,1981,8654,104
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property PhilosophersDyn-PT-03-04 finished in 3521 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:01] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:34:01] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:01] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:34:01] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:01] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:34:01] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:34:01] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:01] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-16 15:34:02] [INFO ] Dead Transitions using invariants and state equation in 944 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, p0, p0]
Running random walk in product with property : PhilosophersDyn-PT-03-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s8 1) (GEQ s28 1) (GEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14302 reset in 276 ms.
Product exploration explored 100000 steps with 14290 reset in 184 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 113 ms :[true, p0, p0]
Product exploration explored 100000 steps with 14308 reset in 191 ms.
Product exploration explored 100000 steps with 14383 reset in 219 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 99 ms :[true, p0, p0]
Support contains 3 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:03] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:34:03] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
[2021-05-16 15:34:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:03] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:34:03] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Product exploration explored 100000 steps with 14287 reset in 225 ms.
Product exploration explored 100000 steps with 14351 reset in 171 ms.
[2021-05-16 15:34:04] [INFO ] Flatten gal took : 5 ms
[2021-05-16 15:34:04] [INFO ] Flatten gal took : 4 ms
[2021-05-16 15:34:04] [INFO ] Time to serialize gal into /tmp/LTL4281223758133278390.gal : 2 ms
[2021-05-16 15:34:04] [INFO ] Time to serialize properties into /tmp/LTL2170126033010600836.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4281223758133278390.gal, -t, CGAL, -LTL, /tmp/LTL2170126033010600836.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4281223758133278390.gal -t CGAL -LTL /tmp/LTL2170126033010600836.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G("(((Outside_3<1)||(Outside_2<1))||(Outside_1<1))"))))
Formula 0 simplified : !XG"(((Outside_3<1)||(Outside_2<1))||(Outside_1<1))"
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t12, t15, t17, t21, t32, t34, t35, t36, t44, t49, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :9/30/12/51
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.095433,20112,1,0,111,14466,116,59,1847,15402,141
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property PhilosophersDyn-PT-03-06 finished in 3233 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:04] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:34:04] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:04] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:34:04] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:04] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:34:04] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:34:04] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2021-05-16 15:34:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:04] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:34:04] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-03-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s28 1) (GEQ s29 1)), p1:(AND (GEQ s14 1) (GEQ 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 4 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-03-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-08 finished in 274 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p1)||G(p2)||p0))))], workingDir=/home/mcc/execution]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:04] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:34:04] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:04] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:34:04] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:04] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:34:05] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:34:05] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2021-05-16 15:34:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:05] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:34:05] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : PhilosophersDyn-PT-03-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s13 1) (LT s25 1) (LT s26 1)), p0:(OR (LT s4 1) (LT s5 1) (LT s16 1)), p2:(OR (LT s4 1) (LT s5 1) (LT s16 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14341 reset in 402 ms.
Product exploration explored 100000 steps with 14339 reset in 246 ms.
Knowledge obtained : [p1, p0, p2]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 14294 reset in 271 ms.
Product exploration explored 100000 steps with 14228 reset in 270 ms.
[2021-05-16 15:34:06] [INFO ] Flatten gal took : 3 ms
[2021-05-16 15:34:07] [INFO ] Flatten gal took : 16 ms
[2021-05-16 15:34:07] [INFO ] Time to serialize gal into /tmp/LTL10677228814749587241.gal : 1 ms
[2021-05-16 15:34:07] [INFO ] Time to serialize properties into /tmp/LTL4977978388533032897.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10677228814749587241.gal, -t, CGAL, -LTL, /tmp/LTL4977978388533032897.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10677228814749587241.gal -t CGAL -LTL /tmp/LTL4977978388533032897.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F((("(((Forks_1<1)||(WaitRight_1<1))||(Neighbourhood_1_1<1))")||(G("(((HasLeft_3<1)||(Neighbourhood_3_2<1))||(HasRight_3<1))")))||(G("(((Forks_1<1)||(WaitRight_1<1))||(Neighbourhood_1_1<1))"))))))
Formula 0 simplified : !GF("(((Forks_1<1)||(WaitRight_1<1))||(Neighbourhood_1_1<1))" | G"(((HasLeft_3<1)||(Neighbourhood_3_2<1))||(HasRight_3<1))" | G"(((Forks_1<1)||(WaitRight_1<1))||(Neighbourhood_1_1<1))")
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t12, t15, t17, t21, t32, t34, t35, t36, t44, t49, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :9/30/12/51
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
15 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.169794,20036,1,0,99,12269,121,45,1895,11200,117
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property PhilosophersDyn-PT-03-09 finished in 2486 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 8 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:07] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:34:07] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:07] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:34:07] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:07] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:34:07] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:34:07] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2021-05-16 15:34:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:07] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:34:07] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-10 automaton TGBA [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 (LT s0 1) (LT s4 1) (LT s10 1) (LT s19 1) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s17 1) (GEQ s25 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 16030 reset in 172 ms.
Product exploration explored 100000 steps with 16028 reset in 172 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16025 reset in 145 ms.
Product exploration explored 100000 steps with 15939 reset in 235 ms.
[2021-05-16 15:34:08] [INFO ] Flatten gal took : 17 ms
[2021-05-16 15:34:08] [INFO ] Flatten gal took : 4 ms
[2021-05-16 15:34:08] [INFO ] Time to serialize gal into /tmp/LTL3367951731496938479.gal : 25 ms
[2021-05-16 15:34:08] [INFO ] Time to serialize properties into /tmp/LTL7884446153152198520.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3367951731496938479.gal, -t, CGAL, -LTL, /tmp/LTL7884446153152198520.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3367951731496938479.gal -t CGAL -LTL /tmp/LTL7884446153152198520.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((Neighbourhood_1_2<1)||(Forks_1<1))||(Think_1<1))||(Neighbourhood_2_1<1))||((((Think_3>=1)&&(Forks_3>=1))&&(Neighbourhood_2_3>=1))&&(Neighbourhood_3_2>=1)))"))))
Formula 0 simplified : !GF"(((((Neighbourhood_1_2<1)||(Forks_1<1))||(Think_1<1))||(Neighbourhood_2_1<1))||((((Think_3>=1)&&(Forks_3>=1))&&(Neighbourhood_2_3>=1))&&(Neighbourhood_3_2>=1)))"
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t12, t15, t17, t21, t32, t34, t35, t36, t44, t49, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :9/30/12/51
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.107625,19696,1,0,105,12454,123,49,1888,11447,134
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property PhilosophersDyn-PT-03-10 finished in 1480 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(!p1)&&(p2||X(F((p2&&F(p1)))))&&p0)))], workingDir=/home/mcc/execution]
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:08] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:34:11] [INFO ] Dead Transitions using invariants and state equation in 2333 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:11] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:34:11] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:11] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:34:11] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:34:11] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:11] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:34:11] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p2) (NOT p0) p1), p1, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : PhilosophersDyn-PT-03-11 automaton TGBA [mat=[[{ cond=(OR (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s14 1) (LT s15 1) (LT s21 1)) (OR (LT s1 1) (LT s12 1))), p1:(AND (GEQ s8 1) (GEQ s28 1) (GEQ s29 1)), p2:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 84 steps with 10 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-11 finished in 2895 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G(p1)||X(F((X(p0)&&p2))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:11] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:34:11] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:11] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:34:11] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:11] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:34:11] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:34:11] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:11] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:34:11] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-03-12 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s28 1) (GEQ s29 1)), p0:(AND (GEQ s9 1) (GEQ s14 1) (GEQ s17 1)), p2:(AND (GEQ s9 1) (GEQ s14 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-12 finished in 540 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X(!p1)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:12] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:34:12] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:12] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:34:12] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:12] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:34:12] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:34:12] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:12] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:34:12] [INFO ] Dead Transitions using invariants and state equation in 302 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true]
Running random walk in product with property : PhilosophersDyn-PT-03-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s14 1) (LT s22 1) (LT s27 1)), p1:(AND (GEQ s8 1) (GEQ s28 1) (GEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 2 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-13 finished in 700 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))&&(X(G(!p0)) U G(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:12] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:34:12] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:12] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:34:12] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:12] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:34:13] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:34:13] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:13] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:34:13] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : PhilosophersDyn-PT-03-14 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (GEQ s8 1) (GEQ s12 1) (GEQ s14 1) (GEQ s25 1)) (GEQ s3 1)), p0:(LT s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-14 finished in 444 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:13] [INFO ] Computed 11 place invariants in 9 ms
[2021-05-16 15:34:13] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:13] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:34:13] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:13] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:34:13] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:34:13] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2021-05-16 15:34:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:34:13] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 15:34:13] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 156 ms :[p0, p0]
Running random walk in product with property : PhilosophersDyn-PT-03-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s5 1) (LT s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-15 finished in 496 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621179254121

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-PT-03"
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-4028"
echo " Executing tool itstools"
echo " Input is PhilosophersDyn-PT-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r159-oct2-162089267800045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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