About the Execution of ITS-Tools for Philosophers-PT-000020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 263.628 | 14132.00 | 16770.00 | 2032.70 | FFFFFFFFFFFTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r140-tall-162298996000117.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/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 Philosophers-PT-000020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162298996000117
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 65K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 421K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 39K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 270K 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.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 27 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 52K Mar 27 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 25 08:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 25 08:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K 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 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 86K 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 Philosophers-PT-000020-00
FORMULA_NAME Philosophers-PT-000020-01
FORMULA_NAME Philosophers-PT-000020-02
FORMULA_NAME Philosophers-PT-000020-03
FORMULA_NAME Philosophers-PT-000020-04
FORMULA_NAME Philosophers-PT-000020-05
FORMULA_NAME Philosophers-PT-000020-06
FORMULA_NAME Philosophers-PT-000020-07
FORMULA_NAME Philosophers-PT-000020-08
FORMULA_NAME Philosophers-PT-000020-09
FORMULA_NAME Philosophers-PT-000020-10
FORMULA_NAME Philosophers-PT-000020-11
FORMULA_NAME Philosophers-PT-000020-12
FORMULA_NAME Philosophers-PT-000020-13
FORMULA_NAME Philosophers-PT-000020-14
FORMULA_NAME Philosophers-PT-000020-15
=== Now, execution of the tool begins
BK_START 1623004789062
Running Version 0
[2021-06-06 18:39:51] [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-06-06 18:39:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 18:39:51] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2021-06-06 18:39:51] [INFO ] Transformed 100 places.
[2021-06-06 18:39:51] [INFO ] Transformed 100 transitions.
[2021-06-06 18:39:51] [INFO ] Found NUPN structural information;
[2021-06-06 18:39:51] [INFO ] Parsed PT model containing 100 places and 100 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-06-06 18:39:51] [INFO ] Initial state test concluded for 1 properties.
Support contains 100 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 9 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:51] [INFO ] Computed 40 place invariants in 6 ms
[2021-06-06 18:39:51] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:51] [INFO ] Computed 40 place invariants in 4 ms
[2021-06-06 18:39:52] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:52] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:52] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
[2021-06-06 18:39:52] [INFO ] Initial state reduction rules for LTL removed 5 formulas.
[2021-06-06 18:39:52] [INFO ] Flatten gal took : 30 ms
FORMULA Philosophers-PT-000020-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-06 18:39:52] [INFO ] Flatten gal took : 19 ms
[2021-06-06 18:39:52] [INFO ] Input system was already deterministic with 100 transitions.
Finished random walk after 60 steps, including 0 resets, run visited all 18 properties in 3 ms. (steps per millisecond=20 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 10 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:52] [INFO ] Computed 40 place invariants in 2 ms
[2021-06-06 18:39:52] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:52] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:52] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2021-06-06 18:39:52] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:52] [INFO ] Computed 40 place invariants in 5 ms
[2021-06-06 18:39:52] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000020-01 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:(OR (AND (EQ s37 1) (EQ s58 1)) (AND (EQ s29 1) (EQ s50 1)) (AND (EQ s34 1) (EQ s53 1)) (AND (EQ s24 1) (EQ s41 1)) (AND (EQ s32 1) (EQ s51 1)) (AND (EQ s36 1) (EQ s55 1)) (AND (EQ s22 1) (EQ s43 1)) (AND (EQ s28 1) (EQ s46 1)) (AND (EQ s40 1) (EQ s59 1)) (AND (EQ s26 1) (EQ s48 1)) (AND (EQ s33 1) (EQ s54 1)) (AND (EQ s30 1) (EQ s49 1)) (AND (EQ s19 1) (EQ s38 1)) (AND (EQ s35 1) (EQ s56 1)) (AND (EQ s39 1) (EQ s60 1)) (AND (EQ s31 1) (EQ s52 1)) (AND (EQ s27 1) (EQ s45 1)) (AND (EQ s23 1) (EQ s42 1)) (AND (EQ s21 1) (EQ s44 1)) (AND (EQ s25 1) (EQ s47 1))), p1:(AND (OR (EQ s5 0) (EQ s26 0)) (OR (EQ s3 0) (EQ s24 0)) (OR (EQ s8 0) (EQ s27 0)) (OR (EQ s2 0) (EQ s21 0)) (OR (EQ s0 0) (EQ s19 0)) (OR (EQ s16 0) (EQ s33 0)) (OR (EQ s10 0) (EQ s32 0)) (OR (EQ s14 0) (EQ s35 0)) (OR (EQ s18 0) (EQ s39 0)) (OR (EQ s1 0) (EQ s22 0)) (OR (EQ s12 0) (EQ s30 0)) (OR (EQ s4 0) (EQ s23 0)) (OR (EQ s6 0) (EQ s25 0)) (OR (EQ s20 0) (EQ s37 0)) (OR (EQ s15 0) (EQ s34 0)) (OR (EQ s11 0) (EQ s29 0)) (OR (EQ s7 0) (EQ s28 0)) (OR (EQ s13 0) (EQ s36 0)) (OR (EQ s17 0) (EQ s40 0)) (OR (EQ s9 0) (EQ s31 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 292 reset in 357 ms.
Stack based approach found an accepted trace after 59 steps with 0 reset with depth 60 and stack size 60 in 1 ms.
FORMULA Philosophers-PT-000020-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-01 finished in 1031 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 11 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:53] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 18:39:53] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:53] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 18:39:53] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2021-06-06 18:39:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:53] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:53] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-02 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 (EQ s5 1) (EQ s23 1)) (AND (EQ s8 1) (EQ s28 1)) (AND (EQ s16 1) (EQ s36 1)) (AND (EQ s3 1) (EQ s21 1)) (AND (EQ s18 1) (EQ s34 1)) (AND (EQ s2 1) (EQ s22 1)) (AND (EQ s6 1) (EQ s26 1)) (AND (EQ s10 1) (EQ s31 1)) (AND (EQ s0 1) (EQ s37 1)) (AND (EQ s9 1) (EQ s27 1)) (AND (EQ s4 1) (EQ s24 1)) (AND (EQ s20 1) (EQ s40 1)) (AND (EQ s1 1) (EQ s19 1)) (AND (EQ s14 1) (EQ s30 1)) (AND (EQ s12 1) (EQ s29 1)) (AND (EQ s7 1) (EQ s25 1)) (AND (EQ s15 1) (EQ s33 1)) (AND (EQ s11 1) (EQ s32 1)) (AND (EQ s13 1) (EQ s35 1)) (AND (EQ s17 1) (EQ s39 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 359 steps with 0 reset in 2 ms.
FORMULA Philosophers-PT-000020-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-02 finished in 378 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(F(p1))||p0) U p1))], workingDir=/home/mcc/execution]
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:53] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 18:39:53] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:53] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 18:39:53] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2021-06-06 18:39:53] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:53] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:54] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000020-03 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s37 1) (EQ s57 1)) (AND (EQ s34 1) (EQ s82 1)) (AND (EQ s31 1) (EQ s74 1)) (AND (EQ s39 1) (EQ s81 1)) (AND (EQ s29 1) (EQ s76 1)) (AND (EQ s21 1) (EQ s67 1)) (AND (EQ s35 1) (EQ s70 1)) (AND (EQ s25 1) (EQ s63 1)) (AND (EQ s23 1) (EQ s61 1)) (AND (EQ s33 1) (EQ s72 1)) (AND (EQ s32 1) (EQ s75 1)) (AND (EQ s24 1) (EQ s68 1)) (AND (EQ s22 1) (EQ s66 1)) (AND (EQ s27 1) (EQ s73 1)) (AND (EQ s19 1) (EQ s65 1)) (AND (EQ s40 1) (EQ s84 1)) (AND (EQ s36 1) (EQ s71 1)) (AND (EQ s28 1) (EQ s64 1)) (AND (EQ s26 1) (EQ s62 1)) (AND (EQ s30 1) (EQ s69 1))), p0:(OR (AND (EQ s37 1) (EQ s57 1)) (AND (EQ s34 1) (EQ s82 1)) (AND (EQ s31 1) (EQ s74 1)) (AND (EQ s39 1) (EQ s81 1)) (AND (EQ s29 1) (EQ s76 1)) (AND (EQ s21 1) (EQ s67 1)) (AND (EQ s35 1) (EQ s70 1)) (AND (EQ s25 1) (EQ s63 1)) (AND (EQ s23 1) (EQ s61 1)) (AND (EQ s33 1) (EQ s72 1)) (AND (EQ s32 1) (EQ s75 1)) (AND (EQ s24 1) (EQ s68 1)) (AND (EQ s22 1) (EQ s66 1)) (AND (EQ s27 1) (EQ s73 1)) (AND (EQ s19 1) (EQ s65 1)) (AND (EQ s40 1) (EQ s84 1)) (AND (EQ s36 1) (EQ s71 1)) (AND (EQ s28 1) (EQ s64 1)) (AND (EQ s26 1) (EQ s62 1)) (AND (EQ s30 1) (EQ s69 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8910 steps with 487 reset in 47 ms.
FORMULA Philosophers-PT-000020-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-03 finished in 500 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:54] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 18:39:54] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:54] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:54] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2021-06-06 18:39:54] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:54] [INFO ] Computed 40 place invariants in 2 ms
[2021-06-06 18:39:54] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-04 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 (AND (EQ s37 1) (EQ s58 1)) (AND (EQ s29 1) (EQ s50 1)) (AND (EQ s34 1) (EQ s53 1)) (AND (EQ s24 1) (EQ s41 1)) (AND (EQ s32 1) (EQ s51 1)) (AND (EQ s36 1) (EQ s55 1)) (AND (EQ s22 1) (EQ s43 1)) (AND (EQ s28 1) (EQ s46 1)) (AND (EQ s40 1) (EQ s59 1)) (AND (EQ s26 1) (EQ s48 1)) (AND (EQ s33 1) (EQ s54 1)) (AND (EQ s30 1) (EQ s49 1)) (AND (EQ s19 1) (EQ s38 1)) (AND (EQ s35 1) (EQ s56 1)) (AND (EQ s39 1) (EQ s60 1)) (AND (EQ s31 1) (EQ s52 1)) (AND (EQ s27 1) (EQ s45 1)) (AND (EQ s23 1) (EQ s42 1)) (AND (EQ s21 1) (EQ s44 1)) (AND (EQ s25 1) (EQ s47 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 6125 steps with 419 reset in 29 ms.
FORMULA Philosophers-PT-000020-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-04 finished in 273 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:54] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 18:39:54] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:54] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:54] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:54] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:54] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-05 automaton TGBA [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 (NEQ s5 1) (NEQ s26 1)) (OR (NEQ s3 1) (NEQ s24 1)) (OR (NEQ s8 1) (NEQ s27 1)) (OR (NEQ s2 1) (NEQ s21 1)) (OR (NEQ s0 1) (NEQ s19 1)) (OR (NEQ s16 1) (NEQ s33 1)) (OR (NEQ s10 1) (NEQ s32 1)) (OR (NEQ s14 1) (NEQ s35 1)) (OR (NEQ s18 1) (NEQ s39 1)) (OR (NEQ s1 1) (NEQ s22 1)) (OR (NEQ s12 1) (NEQ s30 1)) (OR (NEQ s4 1) (NEQ s23 1)) (OR (NEQ s6 1) (NEQ s25 1)) (OR (NEQ s20 1) (NEQ s37 1)) (OR (NEQ s15 1) (NEQ s34 1)) (OR (NEQ s11 1) (NEQ s29 1)) (OR (NEQ s7 1) (NEQ s28 1)) (OR (NEQ s13 1) (NEQ s36 1)) (OR (NEQ s17 1) (NEQ s40 1)) (OR (NEQ s9 1) (NEQ s31 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000020-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-05 finished in 281 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U p1)&&X(p2)&&(X(G(p4))||p3))))], workingDir=/home/mcc/execution]
Support contains 100 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:54] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:54] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:54] [INFO ] Computed 40 place invariants in 2 ms
[2021-06-06 18:39:55] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:55] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:55] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p2) (NOT p1) (AND (NOT p3) (NOT p4))), (OR (NOT p2) (NOT p1) (AND (NOT p3) (NOT p4))), true, (NOT p1), (NOT p2), (NOT p4)]
Running random walk in product with property : Philosophers-PT-000020-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR p1 p0), acceptance={} source=1 dest: 4}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}], [{ cond=(NOT p4), acceptance={} source=5 dest: 2}, { cond=p4, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s97 1) (EQ s96 1) (EQ s99 1) (EQ s98 1) (EQ s77 1) (EQ s79 1) (EQ s78 1) (EQ s80 1) (EQ s83 1) (EQ s85 1) (EQ s87 1) (EQ s86 1) (EQ s89 1) (EQ s88 1) (EQ s91 1) (EQ s90 1) (EQ s93 1) (EQ s92 1) (EQ s95 1) (EQ s94 1)), p0:(OR (AND (EQ s5 1) (EQ s23 1)) (AND (EQ s8 1) (EQ s28 1)) (AND (EQ s16 1) (EQ s36 1)) (AND (EQ s3 1) (EQ s21 1)) (AND (EQ s18 1) (EQ s34 1)) (AND (EQ s2 1) (EQ s22 1)) (AND (EQ s6 1) (EQ s26 1)) (AND (EQ s10 1) (EQ s31 1)) (AND (EQ s0 1) (EQ s37 1)) (AND (EQ s9 1) (EQ s27 1)) (AND (EQ s4 1) (EQ s24 1)) (AND (EQ s20 1) (EQ s40 1)) (AND (EQ s1 1) (EQ s19 1)) (AND (EQ s14 1) (EQ s30 1)) (AND (EQ s12 1) (EQ s29 1)) (AND (EQ s7 1) (EQ s25 1)) (AND (EQ s15 1) (EQ s33 1)) (AND (EQ s11 1) (EQ s32 1)) (AND (EQ s13 1) (EQ s35 1)) (AND (EQ s17 1) (EQ s39 1))), p3:(OR (EQ s97 1) (EQ s96 1) (EQ s99 1) (EQ s98 1) (EQ s77 1) (EQ s79 1) (EQ s78 1) (EQ s80 1) (EQ s83 1) (EQ s85 1) (EQ s87 1) (EQ s86 1) (EQ s89 1) (EQ s88 1) (EQ s91 1) (EQ s90 1) (EQ s93 1) (EQ s92 1) (EQ s95 1) (EQ s94 1)), p2:(OR (AND (EQ s37 1) (EQ s57 1)) (AND (EQ s34 1) (EQ s82 1)) (AND (EQ s31 1) (EQ s74 1)) (AND (EQ s39 1) (EQ s81 1)) (AND (EQ s29 1) (EQ s76 1)) (AND (EQ s21 1) (EQ s67 1)) (AND (EQ s35 1) (EQ s70 1)) (AND (EQ s25 1) (EQ s63 1)) (AND (EQ s23 1) (EQ s61 1)) (AND (EQ s33 1) (EQ s72 1)) (AND (EQ s32 1) (EQ s75 1)) (AND (EQ s24 1) (EQ s68 1)) (AND (EQ s22 1) (EQ s66 1)) (AND (EQ s27 1) (EQ s73 1)) (AND (EQ s19 1) (EQ s65 1)) (AND (EQ s40 1) (EQ s84 1)) (AND (EQ s36 1) (EQ s71 1)) (AND (EQ s28 1) (EQ s64 1)) (AND (EQ s26 1) (EQ s62 1)) (AND (EQ s30 1) (EQ s69 1))), p4:(OR (AND (EQ s37 1) (EQ s58 1)) (AND (EQ s29 1) (EQ s50 1)) (AND (EQ s34 1) (EQ s53 1)) (AND (EQ s24 1) (EQ s41 1)) (AND (EQ s32 1) (EQ s51 1)) (AND (EQ s36 1) (EQ s55 1)) (AND (EQ s22 1) (EQ s43 1)) (AND (EQ s28 1) (EQ s46 1)) (AND (EQ s40 1) (EQ s59 1)) (AND (EQ s26 1) (EQ s48 1)) (AND (EQ s33 1) (EQ s54 1)) (AND (EQ s30 1) (EQ s49 1)) (AND (EQ s19 1) (EQ s38 1)) (AND (EQ s35 1) (EQ s56 1)) (AND (EQ s39 1) (EQ s60 1)) (AND (EQ s31 1) (EQ s52 1)) (AND (EQ s27 1) (EQ s45 1)) (AND (EQ s23 1) (EQ s42 1)) (AND (EQ s21 1) (EQ s44 1)) (AND (EQ s25 1) (EQ s47 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 11 steps with 2 reset in 1 ms.
FORMULA Philosophers-PT-000020-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-06 finished in 417 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((X(p1)||p0) U p2))))], workingDir=/home/mcc/execution]
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:55] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:55] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:55] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 18:39:55] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:55] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 18:39:55] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000020-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}]], initial=0, aps=[p2:(OR (AND (EQ s37 1) (EQ s57 1)) (AND (EQ s34 1) (EQ s82 1)) (AND (EQ s31 1) (EQ s74 1)) (AND (EQ s39 1) (EQ s81 1)) (AND (EQ s29 1) (EQ s76 1)) (AND (EQ s21 1) (EQ s67 1)) (AND (EQ s35 1) (EQ s70 1)) (AND (EQ s25 1) (EQ s63 1)) (AND (EQ s23 1) (EQ s61 1)) (AND (EQ s33 1) (EQ s72 1)) (AND (EQ s32 1) (EQ s75 1)) (AND (EQ s24 1) (EQ s68 1)) (AND (EQ s22 1) (EQ s66 1)) (AND (EQ s27 1) (EQ s73 1)) (AND (EQ s19 1) (EQ s65 1)) (AND (EQ s40 1) (EQ s84 1)) (AND (EQ s36 1) (EQ s71 1)) (AND (EQ s28 1) (EQ s64 1)) (AND (EQ s26 1) (EQ s62 1)) (AND (EQ s30 1) (EQ s69 1))), p0:(OR (AND (EQ s5 1) (EQ s23 1)) (AND (EQ s8 1) (EQ s28 1)) (AND (EQ s16 1) (EQ s36 1)) (AND (EQ s3 1) (EQ s21 1)) (AND (EQ s18 1) (EQ s34 1)) (AND (EQ s2 1) (EQ s22 1)) (AND (EQ s6 1) (EQ s26 1)) (AND (EQ s10 1) (EQ s31 1)) (AND (EQ s0 1) (EQ s37 1)) (AND (EQ s9 1) (EQ s27 1)) (AND (EQ s4 1) (EQ s24 1)) (AND (EQ s20 1) (EQ s40 1)) (AND (EQ s1 1) (EQ s19 1)) (AND (EQ s14 1) (EQ s30 1)) (AND (EQ s12 1) (EQ s29 1)) (AND (EQ s7 1) (EQ s25 1)) (AND (EQ s15 1) (EQ s33 1)) (AND (EQ s11 1) (EQ s32 1)) (AND (EQ s13 1) (EQ s35 1)) (AND (EQ s17 1) (EQ s39 1))), p1:(OR (AND (EQ s5 1) (EQ s23 1)) (AND (EQ s8 1) (EQ s28 1)) (AND (EQ s16 1) (EQ s36 1)) (AND (EQ s3 1) (EQ s21 1)) (AND (EQ s18 1) (EQ s34 1)) (AND (EQ s2 1) (EQ s22 1)) (AND (EQ s6 1) (EQ s26 1)) (AND (EQ s10 1) (EQ s31 1)) (AND (EQ s0 1) (EQ s37 1)) (AND (EQ s9 1) (EQ s27 1)) (AND (EQ s4 1) (EQ s24 1)) (AND (EQ s20 1) (EQ s40 1)) (AND (EQ s1 1) (EQ s19 1)) (AND (EQ s14 1) (EQ s30 1)) (AND (EQ s12 1) (EQ s29 1)) (AND (EQ s7 1) (EQ s25 1)) (AND (EQ s15 1) (EQ s33 1)) (AND (EQ s11 1) (EQ s32 1)) (AND (EQ s13 1) (EQ s35 1)) (AND (EQ s17 1) (EQ s39 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 20299 steps with 1535 reset in 105 ms.
FORMULA Philosophers-PT-000020-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-07 finished in 357 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F(G(p1))&&(p2 U (p3||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 84 transition count 84
Applied a total of 32 rules in 16 ms. Remains 84 /100 variables (removed 16) and now considering 84/100 (removed 16) transitions.
// Phase 1: matrix 84 rows 84 cols
[2021-06-06 18:39:55] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:55] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 84 rows 84 cols
[2021-06-06 18:39:55] [INFO ] Computed 40 place invariants in 7 ms
[2021-06-06 18:39:55] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2021-06-06 18:39:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 84 rows 84 cols
[2021-06-06 18:39:55] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:55] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 84/100 places, 84/100 transitions.
Stuttering acceptance computed with spot in 1468 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p0), (NOT p1), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000020-08 automaton TGBA [mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=0 dest: 2}, { cond=(OR p3 p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (OR (NEQ s20 1) (NEQ s37 1)) (NEQ s5 0) (NEQ s23 0)), p2:(AND (NEQ s5 0) (NEQ s23 0)), p0:(EQ s83 1), p1:(OR (NEQ s5 1) (NEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 351 steps with 4 reset in 2 ms.
FORMULA Philosophers-PT-000020-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-08 finished in 1698 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:57] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:57] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:57] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 18:39:57] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:57] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:57] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-09 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s15 1) (NEQ s33 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 2 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000020-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-09 finished in 308 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 82 transition count 82
Applied a total of 36 rules in 8 ms. Remains 82 /100 variables (removed 18) and now considering 82/100 (removed 18) transitions.
// Phase 1: matrix 82 rows 82 cols
[2021-06-06 18:39:57] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 18:39:57] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 82 rows 82 cols
[2021-06-06 18:39:57] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:57] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2021-06-06 18:39:57] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 82 rows 82 cols
[2021-06-06 18:39:57] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 18:39:57] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 82/100 places, 82/100 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s0 1) (EQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000020-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-10 finished in 342 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||(F(p1)&&X(F(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:58] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:58] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:58] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 18:39:58] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:58] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:58] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000020-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s9 0) (EQ s27 0)), p1:(AND (EQ s34 1) (EQ s53 1)), p2:(AND (EQ s23 1) (EQ s42 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10866 reset in 452 ms.
Stack based approach found an accepted trace after 416 steps with 36 reset with depth 6 and stack size 6 in 3 ms.
FORMULA Philosophers-PT-000020-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-13 finished in 779 ms.
All properties solved without resorting to model-checking.
BK_STOP 1623004803194
--------------------
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="Philosophers-PT-000020"
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 Philosophers-PT-000020, 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 r140-tall-162298996000117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000020.tgz
mv Philosophers-PT-000020 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 ;