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-162298995800013.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-COL-000020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162298995800013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 3.1K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 08:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 11K 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-COL-000020-00
FORMULA_NAME Philosophers-COL-000020-01
FORMULA_NAME Philosophers-COL-000020-02
FORMULA_NAME Philosophers-COL-000020-03
FORMULA_NAME Philosophers-COL-000020-04
FORMULA_NAME Philosophers-COL-000020-05
FORMULA_NAME Philosophers-COL-000020-06
FORMULA_NAME Philosophers-COL-000020-07
FORMULA_NAME Philosophers-COL-000020-08
FORMULA_NAME Philosophers-COL-000020-09
FORMULA_NAME Philosophers-COL-000020-10
FORMULA_NAME Philosophers-COL-000020-11
FORMULA_NAME Philosophers-COL-000020-12
FORMULA_NAME Philosophers-COL-000020-13
FORMULA_NAME Philosophers-COL-000020-14
FORMULA_NAME Philosophers-COL-000020-15

=== Now, execution of the tool begins

BK_START 1622990153210

Running Version 0
[2021-06-06 14:35:55] [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 14:35:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 14:35:56] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-06-06 14:35:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-06-06 14:35:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 766 ms
[2021-06-06 14:35:56] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 100 PT places and 100.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-06-06 14:35:57] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions in 19 ms.
[2021-06-06 14:35:57] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_7055551555638642193.dot
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2021-06-06 14:35:57] [INFO ] Flatten gal took : 22 ms
[2021-06-06 14:35:57] [INFO ] Flatten gal took : 3 ms
[2021-06-06 14:35:57] [INFO ] Unfolded HLPN to a Petri net with 100 places and 100 transitions in 7 ms.
[2021-06-06 14:35:57] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_14309929686807562219.dot
[2021-06-06 14:35:57] [INFO ] Initial state test concluded for 2 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 84 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 14:35:57] [INFO ] Computed 40 place invariants in 12 ms
[2021-06-06 14:35:57] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:35:57] [INFO ] Computed 40 place invariants in 13 ms
[2021-06-06 14:35:57] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:35:57] [INFO ] Computed 40 place invariants in 11 ms
[2021-06-06 14:35:57] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
[2021-06-06 14:35:58] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-06-06 14:35:58] [INFO ] Flatten gal took : 36 ms
FORMULA Philosophers-COL-000020-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-06 14:35:58] [INFO ] Flatten gal took : 27 ms
[2021-06-06 14:35:58] [INFO ] Input system was already deterministic with 100 transitions.
Finished random walk after 30 steps, including 0 resets, run visited all 11 properties in 5 ms. (steps per millisecond=6 )
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 13 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 14:35:58] [INFO ] Computed 40 place invariants in 3 ms
[2021-06-06 14:35:58] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:35:58] [INFO ] Computed 40 place invariants in 2 ms
[2021-06-06 14:35:58] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2021-06-06 14:35:58] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:35:58] [INFO ] Computed 40 place invariants in 3 ms
[2021-06-06 14:35:58] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 371 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-COL-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 (GEQ s29 1) (GEQ s49 1)) (AND (GEQ s37 1) (GEQ s57 1)) (AND (GEQ s21 1) (GEQ s41 1)) (AND (GEQ s22 1) (GEQ s42 1)) (AND (GEQ s24 1) (GEQ s44 1)) (AND (GEQ s26 1) (GEQ s46 1)) (AND (GEQ s28 1) (GEQ s48 1)) (AND (GEQ s30 1) (GEQ s50 1)) (AND (GEQ s32 1) (GEQ s52 1)) (AND (GEQ s34 1) (GEQ s54 1)) (AND (GEQ s36 1) (GEQ s56 1)) (AND (GEQ s38 1) (GEQ s58 1)) (AND (GEQ s25 1) (GEQ s45 1)) (AND (GEQ s33 1) (GEQ s53 1)) (AND (GEQ s20 1) (GEQ s40 1)) (AND (GEQ s23 1) (GEQ s43 1)) (AND (GEQ s27 1) (GEQ s47 1)) (AND (GEQ s31 1) (GEQ s51 1)) (AND (GEQ s35 1) (GEQ s55 1)) (AND (GEQ s39 1) (GEQ s59 1))), p1:(AND (OR (LT s0 1) (LT s20 1)) (OR (LT s5 1) (LT s25 1)) (OR (LT s8 1) (LT s28 1)) (OR (LT s13 1) (LT s33 1)) (OR (LT s16 1) (LT s36 1)) (OR (LT s3 1) (LT s23 1)) (OR (LT s2 1) (LT s22 1)) (OR (LT s6 1) (LT s26 1)) (OR (LT s10 1) (LT s30 1)) (OR (LT s14 1) (LT s34 1)) (OR (LT s18 1) (LT s38 1)) (OR (LT s4 1) (LT s24 1)) (OR (LT s9 1) (LT s29 1)) (OR (LT s12 1) (LT s32 1)) (OR (LT s17 1) (LT s37 1)) (OR (LT s1 1) (LT s21 1)) (OR (LT s7 1) (LT s27 1)) (OR (LT s11 1) (LT s31 1)) (OR (LT s15 1) (LT s35 1)) (OR (LT s19 1) (LT s39 1)))], 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 270 reset in 735 ms.
Stack based approach found an accepted trace after 27 steps with 1 reset with depth 23 and stack size 23 in 1 ms.
FORMULA Philosophers-COL-000020-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-01 finished in 1499 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 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 14:35:59] [INFO ] Computed 40 place invariants in 7 ms
[2021-06-06 14:36:00] [INFO ] Implicit Places using invariants in 196 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:00] [INFO ] Computed 40 place invariants in 10 ms
[2021-06-06 14:36:00] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2021-06-06 14:36:00] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:00] [INFO ] Computed 40 place invariants in 9 ms
[2021-06-06 14:36:00] [INFO ] Dead Transitions using invariants and state equation in 118 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-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 (GEQ s5 1) (GEQ s24 1)) (AND (GEQ s13 1) (GEQ s32 1)) (AND (GEQ s16 1) (GEQ s35 1)) (AND (GEQ s18 1) (GEQ s37 1)) (AND (GEQ s8 1) (GEQ s27 1)) (AND (GEQ s10 1) (GEQ s29 1)) (AND (GEQ s2 1) (GEQ s21 1)) (AND (GEQ s3 1) (GEQ s22 1)) (AND (GEQ s17 1) (GEQ s36 1)) (AND (GEQ s9 1) (GEQ s28 1)) (AND (GEQ s0 1) (GEQ s39 1)) (AND (GEQ s14 1) (GEQ s33 1)) (AND (GEQ s4 1) (GEQ s23 1)) (AND (GEQ s6 1) (GEQ s25 1)) (AND (GEQ s12 1) (GEQ s31 1)) (AND (GEQ s1 1) (GEQ s20 1)) (AND (GEQ s15 1) (GEQ s34 1)) (AND (GEQ s19 1) (GEQ s38 1)) (AND (GEQ s7 1) (GEQ s26 1)) (AND (GEQ s11 1) (GEQ s30 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 203 steps with 0 reset in 2 ms.
FORMULA Philosophers-COL-000020-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-02 finished in 619 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0)) U 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 12 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 14:36:00] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:00] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:00] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:00] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2021-06-06 14:36:00] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:00] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:00] [INFO ] Dead Transitions using invariants and state equation in 133 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000020-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s36 1) (GEQ s77 1)) (AND (GEQ s20 1) (GEQ s61 1)) (AND (GEQ s28 1) (GEQ s69 1)) (AND (GEQ s29 1) (GEQ s70 1)) (AND (GEQ s31 1) (GEQ s72 1)) (AND (GEQ s33 1) (GEQ s74 1)) (AND (GEQ s35 1) (GEQ s76 1)) (AND (GEQ s37 1) (GEQ s78 1)) (AND (GEQ s21 1) (GEQ s62 1)) (AND (GEQ s23 1) (GEQ s64 1)) (AND (GEQ s25 1) (GEQ s66 1)) (AND (GEQ s27 1) (GEQ s68 1)) (AND (GEQ s32 1) (GEQ s73 1)) (AND (GEQ s24 1) (GEQ s65 1)) (AND (GEQ s39 1) (GEQ s60 1)) (AND (GEQ s30 1) (GEQ s71 1)) (AND (GEQ s34 1) (GEQ s75 1)) (AND (GEQ s38 1) (GEQ s79 1)) (AND (GEQ s22 1) (GEQ s63 1)) (AND (GEQ s26 1) (GEQ s67 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 17355 steps with 962 reset in 112 ms.
FORMULA Philosophers-COL-000020-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-03 finished in 738 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 6 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 14:36:01] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:01] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:01] [INFO ] Computed 40 place invariants in 3 ms
[2021-06-06 14:36:01] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2021-06-06 14:36:01] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:01] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:01] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-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 (GEQ s29 1) (GEQ s49 1)) (AND (GEQ s37 1) (GEQ s57 1)) (AND (GEQ s21 1) (GEQ s41 1)) (AND (GEQ s22 1) (GEQ s42 1)) (AND (GEQ s24 1) (GEQ s44 1)) (AND (GEQ s26 1) (GEQ s46 1)) (AND (GEQ s28 1) (GEQ s48 1)) (AND (GEQ s30 1) (GEQ s50 1)) (AND (GEQ s32 1) (GEQ s52 1)) (AND (GEQ s34 1) (GEQ s54 1)) (AND (GEQ s36 1) (GEQ s56 1)) (AND (GEQ s38 1) (GEQ s58 1)) (AND (GEQ s25 1) (GEQ s45 1)) (AND (GEQ s33 1) (GEQ s53 1)) (AND (GEQ s20 1) (GEQ s40 1)) (AND (GEQ s23 1) (GEQ s43 1)) (AND (GEQ s27 1) (GEQ s47 1)) (AND (GEQ s31 1) (GEQ s51 1)) (AND (GEQ s35 1) (GEQ s55 1)) (AND (GEQ s39 1) (GEQ s59 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 7549 steps with 552 reset in 46 ms.
FORMULA Philosophers-COL-000020-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-04 finished in 461 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 4 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 14:36:01] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:01] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:01] [INFO ] Computed 40 place invariants in 10 ms
[2021-06-06 14:36:01] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:01] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:02] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-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 (LT s0 1) (LT s20 1)) (OR (LT s5 1) (LT s25 1)) (OR (LT s8 1) (LT s28 1)) (OR (LT s13 1) (LT s33 1)) (OR (LT s16 1) (LT s36 1)) (OR (LT s3 1) (LT s23 1)) (OR (LT s2 1) (LT s22 1)) (OR (LT s6 1) (LT s26 1)) (OR (LT s10 1) (LT s30 1)) (OR (LT s14 1) (LT s34 1)) (OR (LT s18 1) (LT s38 1)) (OR (LT s4 1) (LT s24 1)) (OR (LT s9 1) (LT s29 1)) (OR (LT s12 1) (LT s32 1)) (OR (LT s17 1) (LT s37 1)) (OR (LT s1 1) (LT s21 1)) (OR (LT s7 1) (LT s27 1)) (OR (LT s11 1) (LT s31 1)) (OR (LT s15 1) (LT s35 1)) (OR (LT s19 1) (LT s39 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 0 ms.
FORMULA Philosophers-COL-000020-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-05 finished in 517 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 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 14:36:02] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:02] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:02] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:02] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:02] [INFO ] Computed 40 place invariants in 6 ms
[2021-06-06 14:36:02] [INFO ] Dead Transitions using invariants and state equation in 124 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 366 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-COL-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 (GEQ s97 1) (GEQ s96 1) (GEQ s99 1) (GEQ s98 1) (GEQ s81 1) (GEQ s80 1) (GEQ s83 1) (GEQ s82 1) (GEQ s85 1) (GEQ s84 1) (GEQ s87 1) (GEQ s86 1) (GEQ s89 1) (GEQ s88 1) (GEQ s91 1) (GEQ s90 1) (GEQ s93 1) (GEQ s92 1) (GEQ s95 1) (GEQ s94 1)), p0:(OR (AND (GEQ s5 1) (GEQ s24 1)) (AND (GEQ s13 1) (GEQ s32 1)) (AND (GEQ s16 1) (GEQ s35 1)) (AND (GEQ s18 1) (GEQ s37 1)) (AND (GEQ s8 1) (GEQ s27 1)) (AND (GEQ s10 1) (GEQ s29 1)) (AND (GEQ s2 1) (GEQ s21 1)) (AND (GEQ s3 1) (GEQ s22 1)) (AND (GEQ s17 1) (GEQ s36 1)) (AND (GEQ s9 1) (GEQ s28 1)) (AND (GEQ s0 1) (GEQ s39 1)) (AND (GEQ s14 1) (GEQ s33 1)) (AND (GEQ s4 1) (GEQ s23 1)) (AND (GEQ s6 1) (GEQ s25 1)) (AND (GEQ s12 1) (GEQ s31 1)) (AND (GEQ s1 1) (GEQ s20 1)) (AND (GEQ s15 1) (GEQ s34 1)) (AND (GEQ s19 1) (GEQ s38 1)) (AND (GEQ s7 1) (GEQ s26 1)) (AND (GEQ s11 1) (GEQ s30 1))), p3:(OR (GEQ s97 1) (GEQ s96 1) (GEQ s99 1) (GEQ s98 1) (GEQ s81 1) (GEQ s80 1) (GEQ s83 1) (GEQ s82 1) (GEQ s85 1) (GEQ s84 1) (GEQ s87 1) (GEQ s86 1) (GEQ s89 1) (GEQ s88 1) (GEQ s91 1) (GEQ s90 1) (GEQ s93 1) (GEQ s92 1) (GEQ s95 1) (GEQ s94 1)), p2:(OR (AND (GEQ s36 1) (GEQ s77 1)) (AND (GEQ s20 1) (GEQ s61 1)) (AND (GEQ s28 1) (GEQ s69 1)) (AND (GEQ s29 1) (GEQ s70 1)) (AND (GEQ s31 1) (GEQ s72 1)) (AND (GEQ s33 1) (GEQ s74 1)) (AND (GEQ s35 1) (GEQ s76 1)) (AND (GEQ s37 1) (GEQ s78 1)) (AND (GEQ s21 1) (GEQ s62 1)) (AND (GEQ s23 1) (GEQ s64 1)) (AND (GEQ s25 1) (GEQ s66 1)) (AND (GEQ s27 1) (GEQ s68 1)) (AND (GEQ s32 1) (GEQ s73 1)) (AND (GEQ s24 1) (GEQ s65 1)) (AND (GEQ s39 1) (GEQ s60 1)) (AND (GEQ s30 1) (GEQ s71 1)) (AND (GEQ s34 1) (GEQ s75 1)) (AND (GEQ s38 1) (GEQ s79 1)) (AND (GEQ s22 1) (GEQ s63 1)) (AND (GEQ s26 1) (GEQ s67 1))), p4:(OR (AND (GEQ s29 1) (GEQ s49 1)) (AND (GEQ s37 1) (GEQ s57 1)) (AND (GEQ s21 1) (GEQ s41 1)) (AND (GEQ s22 1) (GEQ s42 1)) (AND (GEQ s24 1) (GEQ s44 1)) (AND (GEQ s26 1) (GEQ s46 1)) (AND (GEQ s28 1) (GEQ s48 1)) (AND (GEQ s30 1) (GEQ s50 1)) (AND (GEQ s32 1) (GEQ s52 1)) (AND (GEQ s34 1) (GEQ s54 1)) (AND (GEQ s36 1) (GEQ s56 1)) (AND (GEQ s38 1) (GEQ s58 1)) (AND (GEQ s25 1) (GEQ s45 1)) (AND (GEQ s33 1) (GEQ s53 1)) (AND (GEQ s20 1) (GEQ s40 1)) (AND (GEQ s23 1) (GEQ s43 1)) (AND (GEQ s27 1) (GEQ s47 1)) (AND (GEQ s31 1) (GEQ s51 1)) (AND (GEQ s35 1) (GEQ s55 1)) (AND (GEQ s39 1) (GEQ s59 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 42 steps with 6 reset in 1 ms.
FORMULA Philosophers-COL-000020-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-06 finished in 765 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 14:36:02] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 14:36:03] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:03] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:03] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:03] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:03] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-COL-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 (GEQ s36 1) (GEQ s77 1)) (AND (GEQ s20 1) (GEQ s61 1)) (AND (GEQ s28 1) (GEQ s69 1)) (AND (GEQ s29 1) (GEQ s70 1)) (AND (GEQ s31 1) (GEQ s72 1)) (AND (GEQ s33 1) (GEQ s74 1)) (AND (GEQ s35 1) (GEQ s76 1)) (AND (GEQ s37 1) (GEQ s78 1)) (AND (GEQ s21 1) (GEQ s62 1)) (AND (GEQ s23 1) (GEQ s64 1)) (AND (GEQ s25 1) (GEQ s66 1)) (AND (GEQ s27 1) (GEQ s68 1)) (AND (GEQ s32 1) (GEQ s73 1)) (AND (GEQ s24 1) (GEQ s65 1)) (AND (GEQ s39 1) (GEQ s60 1)) (AND (GEQ s30 1) (GEQ s71 1)) (AND (GEQ s34 1) (GEQ s75 1)) (AND (GEQ s38 1) (GEQ s79 1)) (AND (GEQ s22 1) (GEQ s63 1)) (AND (GEQ s26 1) (GEQ s67 1))), p0:(OR (AND (GEQ s5 1) (GEQ s24 1)) (AND (GEQ s13 1) (GEQ s32 1)) (AND (GEQ s16 1) (GEQ s35 1)) (AND (GEQ s18 1) (GEQ s37 1)) (AND (GEQ s8 1) (GEQ s27 1)) (AND (GEQ s10 1) (GEQ s29 1)) (AND (GEQ s2 1) (GEQ s21 1)) (AND (GEQ s3 1) (GEQ s22 1)) (AND (GEQ s17 1) (GEQ s36 1)) (AND (GEQ s9 1) (GEQ s28 1)) (AND (GEQ s0 1) (GEQ s39 1)) (AND (GEQ s14 1) (GEQ s33 1)) (AND (GEQ s4 1) (GEQ s23 1)) (AND (GEQ s6 1) (GEQ s25 1)) (AND (GEQ s12 1) (GEQ s31 1)) (AND (GEQ s1 1) (GEQ s20 1)) (AND (GEQ s15 1) (GEQ s34 1)) (AND (GEQ s19 1) (GEQ s38 1)) (AND (GEQ s7 1) (GEQ s26 1)) (AND (GEQ s11 1) (GEQ s30 1))), p1:(OR (AND (GEQ s5 1) (GEQ s24 1)) (AND (GEQ s13 1) (GEQ s32 1)) (AND (GEQ s16 1) (GEQ s35 1)) (AND (GEQ s18 1) (GEQ s37 1)) (AND (GEQ s8 1) (GEQ s27 1)) (AND (GEQ s10 1) (GEQ s29 1)) (AND (GEQ s2 1) (GEQ s21 1)) (AND (GEQ s3 1) (GEQ s22 1)) (AND (GEQ s17 1) (GEQ s36 1)) (AND (GEQ s9 1) (GEQ s28 1)) (AND (GEQ s0 1) (GEQ s39 1)) (AND (GEQ s14 1) (GEQ s33 1)) (AND (GEQ s4 1) (GEQ s23 1)) (AND (GEQ s6 1) (GEQ s25 1)) (AND (GEQ s12 1) (GEQ s31 1)) (AND (GEQ s1 1) (GEQ s20 1)) (AND (GEQ s15 1) (GEQ s34 1)) (AND (GEQ s19 1) (GEQ s38 1)) (AND (GEQ s7 1) (GEQ s26 1)) (AND (GEQ s11 1) (GEQ s30 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 3611 steps with 274 reset in 28 ms.
FORMULA Philosophers-COL-000020-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-07 finished in 415 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((F((G(p1)||X((!p2 U (p3||G(!p2))))))&&p0))))], workingDir=/home/mcc/execution]
Support contains 80 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 14:36:03] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:03] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:03] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:03] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:03] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:03] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3) p2)]
Running random walk in product with property : Philosophers-COL-000020-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s5 1) (LT s24 1)) (OR (LT s13 1) (LT s32 1)) (OR (LT s16 1) (LT s35 1)) (OR (LT s18 1) (LT s37 1)) (OR (LT s8 1) (LT s27 1)) (OR (LT s10 1) (LT s29 1)) (OR (LT s2 1) (LT s21 1)) (OR (LT s3 1) (LT s22 1)) (OR (LT s17 1) (LT s36 1)) (OR (LT s9 1) (LT s28 1)) (OR (LT s0 1) (LT s39 1)) (OR (LT s14 1) (LT s33 1)) (OR (LT s4 1) (LT s23 1)) (OR (LT s6 1) (LT s25 1)) (OR (LT s12 1) (LT s31 1)) (OR (LT s1 1) (LT s20 1)) (OR (LT s15 1) (LT s34 1)) (OR (LT s19 1) (LT s38 1)) (OR (LT s7 1) (LT s26 1)) (OR (LT s11 1) (LT s30 1))), p1:(OR (AND (GEQ s5 1) (GEQ s24 1)) (AND (GEQ s13 1) (GEQ s32 1)) (AND (GEQ s16 1) (GEQ s35 1)) (AND (GEQ s18 1) (GEQ s37 1)) (AND (GEQ s8 1) (GEQ s27 1)) (AND (GEQ s10 1) (GEQ s29 1)) (AND (GEQ s2 1) (GEQ s21 1)) (AND (GEQ s3 1) (GEQ s22 1)) (AND (GEQ s17 1) (GEQ s36 1)) (AND (GEQ s9 1) (GEQ s28 1)) (AND (GEQ s0 1) (GEQ s39 1)) (AND (GEQ s14 1) (GEQ s33 1)) (AND (GEQ s4 1) (GEQ s23 1)) (AND (GEQ s6 1) (GEQ s25 1)) (AND (GEQ s12 1) (GEQ s31 1)) (AND (GEQ s1 1) (GEQ s20 1)) (AND (GEQ s15 1) (GEQ s34 1)) (AND (GEQ s19 1) (GEQ s38 1)) (AND (GEQ s7 1) (GEQ s26 1)) (AND (GEQ s11 1) (GEQ s30 1))), p3:(AND (OR (LT s29 1) (LT s49 1)) (OR (LT s37 1) (LT s57 1)) (OR (LT s21 1) (LT s41 1)) (OR (LT s22 1) (LT s42 1)) (OR (LT s24 1) (LT s44 1)) (OR (LT s26 1) (LT s46 1)) (OR (LT s28 1) (LT s48 1)) (OR (LT s30 1) (LT s50 1)) (OR (LT s32 1) (LT s52 1)) (OR (LT s34 1) (LT s54 1)) (OR (LT s36 1) (LT s56 1)) (OR (LT s38 1) (LT s58 1)) (OR (LT s25 1) (LT s45 1)) (OR (LT s33 1) (LT s53 1)) (OR (LT s20 1) (LT s40 1)) (OR (LT s23 1) (LT s43 1)) (OR (LT s27 1) (LT s47 1)) (OR (LT s31 1) (LT s51 1)) (OR (LT s35 1) (LT s55 1)) (OR (LT s39 1) (LT s59 1)) (OR (LT s36 1) (LT s77 1)) (OR (LT s20 1) (LT s61 1)) (OR (LT s28 1) (LT s69 1)) (OR (LT s29 1) (LT s70 1)) (OR (LT s31 1) (LT s72 1)) (OR (LT s33 1) (LT s74 1)) (OR (LT s35 1) (LT s76 1)) (OR (LT s37 1) (LT s78 1)) (OR (LT s21 1) (LT s62 1)) (OR (LT s23 1) (LT s64 1)) (OR (LT s25 1) (LT s66 1)) (OR (LT s27 1) (LT s68 1)) (OR (LT s32 1) (LT s73 1)) (OR (LT s24 1) (LT s65 1)) (OR (LT s39 1) (LT s60 1)) (OR (LT s30 1) (LT s71 1)) (OR (LT s34 1) (LT s75 1)) (OR (LT s38 1) (LT s79 1)) (OR (LT s22 1) (LT s63 1)) (OR (LT s26 1) (LT s67 1))), p2:(OR (AND (GEQ s36 1) (GEQ s77 1)) (AND (GEQ s20 1) (GEQ s61 1)) (AND (GEQ s28 1) (GEQ s69 1)) (AND (GEQ s29 1) (GEQ s70 1)) (AND (GEQ s31 1) (GEQ s72 1)) (AND (GEQ s33 1) (GEQ s74 1)) (AND (GEQ s35 1) (GEQ s76 1)) (AND (GEQ s37 1) (GEQ s78 1)) (AND (GEQ s21 1) (GEQ s62 1)) (AND (GEQ s23 1) (GEQ s64 1)) (AND (GEQ s25 1) (GEQ s66 1)) (AND (GEQ s27 1) (GEQ s68 1)) (AND (GEQ s32 1) (GEQ s73 1)) (AND (GEQ s24 1) (GEQ s65 1)) (AND (GEQ s39 1) (GEQ s60 1)) (AND (GEQ s30 1) (GEQ s71 1)) (AND (GEQ s34 1) (GEQ s75 1)) (AND (GEQ s38 1) (GEQ s79 1)) (AND (GEQ s22 1) (GEQ s63 1)) (AND (GEQ s26 1) (GEQ s67 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2247 reset in 670 ms.
Stack based approach found an accepted trace after 211 steps with 5 reset with depth 23 and stack size 23 in 2 ms.
FORMULA Philosophers-COL-000020-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-08 finished in 1090 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 14:36:04] [INFO ] Computed 40 place invariants in 8 ms
[2021-06-06 14:36:04] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:04] [INFO ] Computed 40 place invariants in 2 ms
[2021-06-06 14:36:04] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:04] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 14:36:04] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000020-09 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:(OR (AND (GEQ s5 1) (GEQ s24 1)) (AND (GEQ s13 1) (GEQ s32 1)) (AND (GEQ s16 1) (GEQ s35 1)) (AND (GEQ s18 1) (GEQ s37 1)) (AND (GEQ s8 1) (GEQ s27 1)) (AND (GEQ s10 1) (GEQ s29 1)) (AND (GEQ s2 1) (GEQ s21 1)) (AND (GEQ s3 1) (GEQ s22 1)) (AND (GEQ s17 1) (GEQ s36 1)) (AND (GEQ s9 1) (GEQ s28 1)) (AND (GEQ s0 1) (GEQ s39 1)) (AND (GEQ s14 1) (GEQ s33 1)) (AND (GEQ s4 1) (GEQ s23 1)) (AND (GEQ s6 1) (GEQ s25 1)) (AND (GEQ s12 1) (GEQ s31 1)) (AND (GEQ s1 1) (GEQ s20 1)) (AND (GEQ s15 1) (GEQ s34 1)) (AND (GEQ s19 1) (GEQ s38 1)) (AND (GEQ s7 1) (GEQ s26 1)) (AND (GEQ s11 1) (GEQ s30 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 24 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000020-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-09 finished in 335 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((!p0&&X(X(!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 14:36:04] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:04] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:04] [INFO ] Computed 40 place invariants in 11 ms
[2021-06-06 14:36:04] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:04] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:05] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 118 ms :[p0, p0, true, p0]
Running random walk in product with property : Philosophers-COL-000020-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (OR (LT s0 1) (LT s20 1)) (OR (LT s5 1) (LT s25 1)) (OR (LT s8 1) (LT s28 1)) (OR (LT s13 1) (LT s33 1)) (OR (LT s16 1) (LT s36 1)) (OR (LT s3 1) (LT s23 1)) (OR (LT s2 1) (LT s22 1)) (OR (LT s6 1) (LT s26 1)) (OR (LT s10 1) (LT s30 1)) (OR (LT s14 1) (LT s34 1)) (OR (LT s18 1) (LT s38 1)) (OR (LT s4 1) (LT s24 1)) (OR (LT s9 1) (LT s29 1)) (OR (LT s12 1) (LT s32 1)) (OR (LT s17 1) (LT s37 1)) (OR (LT s1 1) (LT s21 1)) (OR (LT s7 1) (LT s27 1)) (OR (LT s11 1) (LT s31 1)) (OR (LT s15 1) (LT s35 1)) (OR (LT s19 1) (LT s39 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 21 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000020-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-10 finished in 363 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(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 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 14:36:05] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 14:36:05] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:05] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 14:36:05] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:05] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 14:36:05] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000020-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s36 1) (GEQ s77 1)) (AND (GEQ s20 1) (GEQ s61 1)) (AND (GEQ s28 1) (GEQ s69 1)) (AND (GEQ s29 1) (GEQ s70 1)) (AND (GEQ s31 1) (GEQ s72 1)) (AND (GEQ s33 1) (GEQ s74 1)) (AND (GEQ s35 1) (GEQ s76 1)) (AND (GEQ s37 1) (GEQ s78 1)) (AND (GEQ s21 1) (GEQ s62 1)) (AND (GEQ s23 1) (GEQ s64 1)) (AND (GEQ s25 1) (GEQ s66 1)) (AND (GEQ s27 1) (GEQ s68 1)) (AND (GEQ s32 1) (GEQ s73 1)) (AND (GEQ s24 1) (GEQ s65 1)) (AND (GEQ s39 1) (GEQ s60 1)) (AND (GEQ s30 1) (GEQ s71 1)) (AND (GEQ s34 1) (GEQ s75 1)) (AND (GEQ s38 1) (GEQ s79 1)) (AND (GEQ s22 1) (GEQ s63 1)) (AND (GEQ s26 1) (GEQ s67 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]]
Stuttering criterion allowed to conclude after 44144 steps with 11955 reset in 249 ms.
FORMULA Philosophers-COL-000020-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-11 finished in 636 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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 6 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 14:36:05] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:05] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:05] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 14:36:05] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2021-06-06 14:36:05] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:05] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:06] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 116 ms :[p0]
Running random walk in product with property : Philosophers-COL-000020-12 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s5 1) (GEQ s24 1)) (AND (GEQ s13 1) (GEQ s32 1)) (AND (GEQ s16 1) (GEQ s35 1)) (AND (GEQ s18 1) (GEQ s37 1)) (AND (GEQ s8 1) (GEQ s27 1)) (AND (GEQ s10 1) (GEQ s29 1)) (AND (GEQ s2 1) (GEQ s21 1)) (AND (GEQ s3 1) (GEQ s22 1)) (AND (GEQ s17 1) (GEQ s36 1)) (AND (GEQ s9 1) (GEQ s28 1)) (AND (GEQ s0 1) (GEQ s39 1)) (AND (GEQ s14 1) (GEQ s33 1)) (AND (GEQ s4 1) (GEQ s23 1)) (AND (GEQ s6 1) (GEQ s25 1)) (AND (GEQ s12 1) (GEQ s31 1)) (AND (GEQ s1 1) (GEQ s20 1)) (AND (GEQ s15 1) (GEQ s34 1)) (AND (GEQ s19 1) (GEQ s38 1)) (AND (GEQ s7 1) (GEQ s26 1)) (AND (GEQ s11 1) (GEQ s30 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]]
Product exploration explored 100000 steps with 3075 reset in 507 ms.
Stack based approach found an accepted trace after 644 steps with 21 reset with depth 14 and stack size 14 in 4 ms.
FORMULA Philosophers-COL-000020-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-12 finished in 854 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p1)||p0)))], 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 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 14:36:06] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:06] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:06] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:06] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:06] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:06] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000020-13 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:(OR (AND (GEQ s29 1) (GEQ s49 1)) (AND (GEQ s37 1) (GEQ s57 1)) (AND (GEQ s21 1) (GEQ s41 1)) (AND (GEQ s22 1) (GEQ s42 1)) (AND (GEQ s24 1) (GEQ s44 1)) (AND (GEQ s26 1) (GEQ s46 1)) (AND (GEQ s28 1) (GEQ s48 1)) (AND (GEQ s30 1) (GEQ s50 1)) (AND (GEQ s32 1) (GEQ s52 1)) (AND (GEQ s34 1) (GEQ s54 1)) (AND (GEQ s36 1) (GEQ s56 1)) (AND (GEQ s38 1) (GEQ s58 1)) (AND (GEQ s25 1) (GEQ s45 1)) (AND (GEQ s33 1) (GEQ s53 1)) (AND (GEQ s20 1) (GEQ s40 1)) (AND (GEQ s23 1) (GEQ s43 1)) (AND (GEQ s27 1) (GEQ s47 1)) (AND (GEQ s31 1) (GEQ s51 1)) (AND (GEQ s35 1) (GEQ s55 1)) (AND (GEQ s39 1) (GEQ s59 1))), p0:(OR (AND (GEQ s5 1) (GEQ s24 1)) (AND (GEQ s13 1) (GEQ s32 1)) (AND (GEQ s16 1) (GEQ s35 1)) (AND (GEQ s18 1) (GEQ s37 1)) (AND (GEQ s8 1) (GEQ s27 1)) (AND (GEQ s10 1) (GEQ s29 1)) (AND (GEQ s2 1) (GEQ s21 1)) (AND (GEQ s3 1) (GEQ s22 1)) (AND (GEQ s17 1) (GEQ s36 1)) (AND (GEQ s9 1) (GEQ s28 1)) (AND (GEQ s0 1) (GEQ s39 1)) (AND (GEQ s14 1) (GEQ s33 1)) (AND (GEQ s4 1) (GEQ s23 1)) (AND (GEQ s6 1) (GEQ s25 1)) (AND (GEQ s12 1) (GEQ s31 1)) (AND (GEQ s1 1) (GEQ s20 1)) (AND (GEQ s15 1) (GEQ s34 1)) (AND (GEQ s19 1) (GEQ s38 1)) (AND (GEQ s7 1) (GEQ s26 1)) (AND (GEQ s11 1) (GEQ s30 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 416 ms.
Product exploration explored 100000 steps with 50000 reset in 431 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 417 ms.
Product exploration explored 100000 steps with 50000 reset in 421 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 60 out of 100 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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.
[2021-06-06 14:36:09] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:09] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:09] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Product exploration explored 100000 steps with 50000 reset in 1159 ms.
Product exploration explored 100000 steps with 50000 reset in 1005 ms.
[2021-06-06 14:36:11] [INFO ] Flatten gal took : 14 ms
[2021-06-06 14:36:11] [INFO ] Flatten gal took : 12 ms
[2021-06-06 14:36:11] [INFO ] Time to serialize gal into /tmp/LTL1461427569796716513.gal : 35 ms
[2021-06-06 14:36:11] [INFO ] Time to serialize properties into /tmp/LTL2648341172368911670.ltl : 2 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/LTL1461427569796716513.gal, -t, CGAL, -LTL, /tmp/LTL2648341172368911670.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/LTL1461427569796716513.gal -t CGAL -LTL /tmp/LTL2648341172368911670.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(((((((((((((((((((((F("(((((((((((((((((((((Fork_9>=1)&&(Catch1_9>=1))||((Fork_17>=1)&&(Catch1_17>=1)))||((Fork_1>=1)&&(Catch1_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_4>=1)&&(Catch1_4>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_8>=1)&&(Catch1_8>=1)))||((Fork_10>=1)&&(Catch1_10>=1)))||((Fork_12>=1)&&(Catch1_12>=1)))||((Fork_14>=1)&&(Catch1_14>=1)))||((Fork_16>=1)&&(Catch1_16>=1)))||((Fork_18>=1)&&(Catch1_18>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Fork_13>=1)&&(Catch1_13>=1)))||((Fork_0>=1)&&(Catch1_0>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Fork_11>=1)&&(Catch1_11>=1)))||((Fork_15>=1)&&(Catch1_15>=1)))||((Fork_19>=1)&&(Catch1_19>=1)))"))||("((Think_5>=1)&&(Fork_4>=1))"))||("((Think_13>=1)&&(Fork_12>=1))"))||("((Think_16>=1)&&(Fork_15>=1))"))||("((Think_18>=1)&&(Fork_17>=1))"))||("((Think_8>=1)&&(Fork_7>=1))"))||("((Think_10>=1)&&(Fork_9>=1))"))||("((Think_2>=1)&&(Fork_1>=1))"))||("((Think_3>=1)&&(Fork_2>=1))"))||("((Think_17>=1)&&(Fork_16>=1))"))||("((Think_9>=1)&&(Fork_8>=1))"))||("((Think_0>=1)&&(Fork_19>=1))"))||("((Think_14>=1)&&(Fork_13>=1))"))||("((Think_4>=1)&&(Fork_3>=1))"))||("((Think_6>=1)&&(Fork_5>=1))"))||("((Think_12>=1)&&(Fork_11>=1))"))||("((Think_1>=1)&&(Fork_0>=1))"))||("((Think_15>=1)&&(Fork_14>=1))"))||("((Think_19>=1)&&(Fork_18>=1))"))||("((Think_7>=1)&&(Fork_6>=1))"))||("((Think_11>=1)&&(Fork_10>=1))"))))
Formula 0 simplified : !X("((Think_0>=1)&&(Fork_19>=1))" | "((Think_1>=1)&&(Fork_0>=1))" | "((Think_2>=1)&&(Fork_1>=1))" | "((Think_3>=1)&&(Fork_2>=1))" | "((Think_4>=1)&&(Fork_3>=1))" | "((Think_5>=1)&&(Fork_4>=1))" | "((Think_6>=1)&&(Fork_5>=1))" | "((Think_7>=1)&&(Fork_6>=1))" | "((Think_8>=1)&&(Fork_7>=1))" | "((Think_9>=1)&&(Fork_8>=1))" | "((Think_10>=1)&&(Fork_9>=1))" | "((Think_11>=1)&&(Fork_10>=1))" | "((Think_12>=1)&&(Fork_11>=1))" | "((Think_13>=1)&&(Fork_12>=1))" | "((Think_14>=1)&&(Fork_13>=1))" | "((Think_15>=1)&&(Fork_14>=1))" | "((Think_16>=1)&&(Fork_15>=1))" | "((Think_17>=1)&&(Fork_16>=1))" | "((Think_18>=1)&&(Fork_17>=1))" | "((Think_19>=1)&&(Fork_18>=1))" | F"(((((((((((((((((((((Fork_9>=1)&&(Catch1_9>=1))||((Fork_17>=1)&&(Catch1_17>=1)))||((Fork_1>=1)&&(Catch1_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_4>=1)&&(Catch1_4>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_8>=1)&&(Catch1_8>=1)))||((Fork_10>=1)&&(Catch1_10>=1)))||((Fork_12>=1)&&(Catch1_12>=1)))||((Fork_14>=1)&&(Catch1_14>=1)))||((Fork_16>=1)&&(Catch1_16>=1)))||((Fork_18>=1)&&(Catch1_18>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Fork_13>=1)&&(Catch1_13>=1)))||((Fork_0>=1)&&(Catch1_0>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Fork_11>=1)&&(Catch1_11>=1)))||((Fork_15>=1)&&(Catch1_15>=1)))||((Fork_19>=1)&&(Catch1_19>=1)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
11 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.170732,22276,1,0,8,27228,94,3,2623,3575,7
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Philosophers-COL-000020-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Philosophers-COL-000020-13 finished in 5202 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 20 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 6 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 14:36:11] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 14:36:11] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:11] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 14:36:12] [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-06-06 14:36:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:12] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:12] [INFO ] Dead Transitions using invariants and state equation in 69 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-COL-000020-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s97 1) (GEQ s96 1) (GEQ s99 1) (GEQ s98 1) (GEQ s81 1) (GEQ s80 1) (GEQ s83 1) (GEQ s82 1) (GEQ s85 1) (GEQ s84 1) (GEQ s87 1) (GEQ s86 1) (GEQ s89 1) (GEQ s88 1) (GEQ s91 1) (GEQ s90 1) (GEQ s93 1) (GEQ s92 1) (GEQ s95 1) (GEQ s94 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 989 steps with 0 reset in 5 ms.
FORMULA Philosophers-COL-000020-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-14 finished in 351 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(p0) U (!p1&&X(p2))) U ((G(!p1) U !p2)||p3)))], 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 14:36:12] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:12] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:12] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:12] [INFO ] Implicit Places using invariants and state equation in 93 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 14:36:12] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:12] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 321 ms :[(AND p2 (NOT p3)), (NOT p0), (OR (NOT p2) p1), (AND p1 (NOT p2)), true, (AND (NOT p2) (NOT p0)), (NOT p2), p1]
Running random walk in product with property : Philosophers-COL-000020-15 automaton TGBA [mat=[[{ cond=(AND (NOT p3) p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}, { cond=(NOT p1), acceptance={0} source=2 dest: 6}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 4}, { cond=(NOT p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(OR (GEQ s97 1) (GEQ s96 1) (GEQ s99 1) (GEQ s98 1) (GEQ s81 1) (GEQ s80 1) (GEQ s83 1) (GEQ s82 1) (GEQ s85 1) (GEQ s84 1) (GEQ s87 1) (GEQ s86 1) (GEQ s89 1) (GEQ s88 1) (GEQ s91 1) (GEQ s90 1) (GEQ s93 1) (GEQ s92 1) (GEQ s95 1) (GEQ s94 1)), p2:(OR (AND (GEQ s5 1) (GEQ s24 1)) (AND (GEQ s13 1) (GEQ s32 1)) (AND (GEQ s16 1) (GEQ s35 1)) (AND (GEQ s18 1) (GEQ s37 1)) (AND (GEQ s8 1) (GEQ s27 1)) (AND (GEQ s10 1) (GEQ s29 1)) (AND (GEQ s2 1) (GEQ s21 1)) (AND (GEQ s3 1) (GEQ s22 1)) (AND (GEQ s17 1) (GEQ s36 1)) (AND (GEQ s9 1) (GEQ s28 1)) (AND (GEQ s0 1) (GEQ s39 1)) (AND (GEQ s14 1) (GEQ s33 1)) (AND (GEQ s4 1) (GEQ s23 1)) (AND (GEQ s6 1) (GEQ s25 1)) (AND (GEQ s12 1) (GEQ s31 1)) (AND (GEQ s1 1) (GEQ s20 1)) (AND (GEQ s15 1) (GEQ s34 1)) (AND (GEQ s19 1) (GEQ s38 1)) (AND (GEQ s7 1) (GEQ s26 1)) (AND (GEQ s11 1) (GEQ s30 1))), p1:(AND (OR (LT s0 1) (LT s20 1)) (OR (LT s5 1) (LT s25 1)) (OR (LT s8 1) (LT s28 1)) (OR (LT s13 1) (LT s33 1)) (OR (LT s16 1) (LT s36 1)) (OR (LT s3 1) (LT s23 1)) (OR (LT s2 1) (LT s22 1)) (OR (LT s6 1) (LT s26 1)) (OR (LT s10 1) (LT s30 1)) (OR (LT s14 1) (LT s34 1)) (OR (LT s18 1) (LT s38 1)) (OR (LT s4 1) (LT s24 1)) (OR (LT s9 1) (LT s29 1)) (OR (LT s12 1) (LT s32 1)) (OR (LT s17 1) (LT s37 1)) (OR (LT s1 1) (LT s21 1)) (OR (LT s7 1) (LT s27 1)) (OR (LT s11 1) (LT s31 1)) (OR (LT s15 1) (LT s35 1)) (OR (LT s19 1) (LT s39 1))), p0:(OR (GEQ s97 1) (GEQ s96 1) (GEQ s99 1) (GEQ s98 1) (GEQ s81 1) (GEQ s80 1) (GEQ s83 1) (GEQ s82 1) (GEQ s85 1) (GEQ s84 1) (GEQ s87 1) (GEQ s86 1) (GEQ s89 1) (GEQ s88 1) (GEQ s91 1) (GEQ s90 1) (GEQ s93 1) (GEQ s92 1) (GEQ s95 1) (GEQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33804 reset in 783 ms.
Product exploration explored 100000 steps with 33947 reset in 831 ms.
Knowledge obtained : [(NOT p3), p2, (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 300 ms :[(AND p2 (NOT p3)), (NOT p0), (OR (NOT p2) p1), (AND p1 (NOT p2)), true, (AND (NOT p2) (NOT p0)), (NOT p2), p1]
Product exploration explored 100000 steps with 33905 reset in 810 ms.
Product exploration explored 100000 steps with 33884 reset in 779 ms.
Applying partial POR strategy [false, true, false, false, true, true, false, true]
Stuttering acceptance computed with spot in 290 ms :[(AND p2 (NOT p3)), (NOT p0), (OR (NOT p2) p1), (AND p1 (NOT p2)), true, (AND (NOT p2) (NOT p0)), (NOT p2), p1]
Support contains 60 out of 100 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2021-06-06 14:36:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:17] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 14:36:17] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Product exploration explored 100000 steps with 33792 reset in 801 ms.
Product exploration explored 100000 steps with 33870 reset in 875 ms.
[2021-06-06 14:36:18] [INFO ] Flatten gal took : 12 ms
[2021-06-06 14:36:18] [INFO ] Flatten gal took : 11 ms
[2021-06-06 14:36:18] [INFO ] Time to serialize gal into /tmp/LTL4090161852959018136.gal : 5 ms
[2021-06-06 14:36:18] [INFO ] Time to serialize properties into /tmp/LTL2073479403576966658.ltl : 4 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/LTL4090161852959018136.gal, -t, CGAL, -LTL, /tmp/LTL2073479403576966658.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/LTL4090161852959018136.gal -t CGAL -LTL /tmp/LTL2073479403576966658.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((X("((((((((((((((((((((Eat_17>=1)||(Eat_16>=1))||(Eat_19>=1))||(Eat_18>=1))||(Eat_1>=1))||(Eat_0>=1))||(Eat_3>=1))||(Eat_2>=1))||(Eat_5>=1))||(Eat_4>=1))||(Eat_7>=1))||(Eat_6>=1))||(Eat_9>=1))||(Eat_8>=1))||(Eat_11>=1))||(Eat_10>=1))||(Eat_13>=1))||(Eat_12>=1))||(Eat_15>=1))||(Eat_14>=1))"))U((X("(((((((((((((((((((((Think_5>=1)&&(Fork_4>=1))||((Think_13>=1)&&(Fork_12>=1)))||((Think_16>=1)&&(Fork_15>=1)))||((Think_18>=1)&&(Fork_17>=1)))||((Think_8>=1)&&(Fork_7>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Think_2>=1)&&(Fork_1>=1)))||((Think_3>=1)&&(Fork_2>=1)))||((Think_17>=1)&&(Fork_16>=1)))||((Think_9>=1)&&(Fork_8>=1)))||((Think_0>=1)&&(Fork_19>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_1>=1)&&(Fork_0>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Think_7>=1)&&(Fork_6>=1)))||((Think_11>=1)&&(Fork_10>=1)))"))&&("(((((((((((((((((((((Think_0>=1)&&(Fork_0>=1))||((Think_5>=1)&&(Fork_5>=1)))||((Think_8>=1)&&(Fork_8>=1)))||((Think_13>=1)&&(Fork_13>=1)))||((Think_16>=1)&&(Fork_16>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_2>=1)&&(Fork_2>=1)))||((Think_6>=1)&&(Fork_6>=1)))||((Think_10>=1)&&(Fork_10>=1)))||((Think_14>=1)&&(Fork_14>=1)))||((Think_18>=1)&&(Fork_18>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Think_9>=1)&&(Fork_9>=1)))||((Think_12>=1)&&(Fork_12>=1)))||((Think_17>=1)&&(Fork_17>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Think_11>=1)&&(Fork_11>=1)))||((Think_15>=1)&&(Fork_15>=1)))||((Think_19>=1)&&(Fork_19>=1)))")))U(("((((((((((((((((((((Eat_17>=1)||(Eat_16>=1))||(Eat_19>=1))||(Eat_18>=1))||(Eat_1>=1))||(Eat_0>=1))||(Eat_3>=1))||(Eat_2>=1))||(Eat_5>=1))||(Eat_4>=1))||(Eat_7>=1))||(Eat_6>=1))||(Eat_9>=1))||(Eat_8>=1))||(Eat_11>=1))||(Eat_10>=1))||(Eat_13>=1))||(Eat_12>=1))||(Eat_15>=1))||(Eat_14>=1))")||((G("(((((((((((((((((((((Think_0>=1)&&(Fork_0>=1))||((Think_5>=1)&&(Fork_5>=1)))||((Think_8>=1)&&(Fork_8>=1)))||((Think_13>=1)&&(Fork_13>=1)))||((Think_16>=1)&&(Fork_16>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_2>=1)&&(Fork_2>=1)))||((Think_6>=1)&&(Fork_6>=1)))||((Think_10>=1)&&(Fork_10>=1)))||((Think_14>=1)&&(Fork_14>=1)))||((Think_18>=1)&&(Fork_18>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Think_9>=1)&&(Fork_9>=1)))||((Think_12>=1)&&(Fork_12>=1)))||((Think_17>=1)&&(Fork_17>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Think_11>=1)&&(Fork_11>=1)))||((Think_15>=1)&&(Fork_15>=1)))||((Think_19>=1)&&(Fork_19>=1)))"))U("(((((((((((((((((((((Think_5<1)||(Fork_4<1))&&((Think_13<1)||(Fork_12<1)))&&((Think_16<1)||(Fork_15<1)))&&((Think_18<1)||(Fork_17<1)))&&((Think_8<1)||(Fork_7<1)))&&((Think_10<1)||(Fork_9<1)))&&((Think_2<1)||(Fork_1<1)))&&((Think_3<1)||(Fork_2<1)))&&((Think_17<1)||(Fork_16<1)))&&((Think_9<1)||(Fork_8<1)))&&((Think_0<1)||(Fork_19<1)))&&((Think_14<1)||(Fork_13<1)))&&((Think_4<1)||(Fork_3<1)))&&((Think_6<1)||(Fork_5<1)))&&((Think_12<1)||(Fork_11<1)))&&((Think_1<1)||(Fork_0<1)))&&((Think_15<1)||(Fork_14<1)))&&((Think_19<1)||(Fork_18<1)))&&((Think_7<1)||(Fork_6<1)))&&((Think_11<1)||(Fork_10<1)))")))))
Formula 0 simplified : !((X"((((((((((((((((((((Eat_17>=1)||(Eat_16>=1))||(Eat_19>=1))||(Eat_18>=1))||(Eat_1>=1))||(Eat_0>=1))||(Eat_3>=1))||(Eat_2>=1))||(Eat_5>=1))||(Eat_4>=1))||(Eat_7>=1))||(Eat_6>=1))||(Eat_9>=1))||(Eat_8>=1))||(Eat_11>=1))||(Eat_10>=1))||(Eat_13>=1))||(Eat_12>=1))||(Eat_15>=1))||(Eat_14>=1))" U ("(((((((((((((((((((((Think_0>=1)&&(Fork_0>=1))||((Think_5>=1)&&(Fork_5>=1)))||((Think_8>=1)&&(Fork_8>=1)))||((Think_13>=1)&&(Fork_13>=1)))||((Think_16>=1)&&(Fork_16>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_2>=1)&&(Fork_2>=1)))||((Think_6>=1)&&(Fork_6>=1)))||((Think_10>=1)&&(Fork_10>=1)))||((Think_14>=1)&&(Fork_14>=1)))||((Think_18>=1)&&(Fork_18>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Think_9>=1)&&(Fork_9>=1)))||((Think_12>=1)&&(Fork_12>=1)))||((Think_17>=1)&&(Fork_17>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Think_11>=1)&&(Fork_11>=1)))||((Think_15>=1)&&(Fork_15>=1)))||((Think_19>=1)&&(Fork_19>=1)))" & X"(((((((((((((((((((((Think_5>=1)&&(Fork_4>=1))||((Think_13>=1)&&(Fork_12>=1)))||((Think_16>=1)&&(Fork_15>=1)))||((Think_18>=1)&&(Fork_17>=1)))||((Think_8>=1)&&(Fork_7>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Think_2>=1)&&(Fork_1>=1)))||((Think_3>=1)&&(Fork_2>=1)))||((Think_17>=1)&&(Fork_16>=1)))||((Think_9>=1)&&(Fork_8>=1)))||((Think_0>=1)&&(Fork_19>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_1>=1)&&(Fork_0>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Think_7>=1)&&(Fork_6>=1)))||((Think_11>=1)&&(Fork_10>=1)))")) U ("((((((((((((((((((((Eat_17>=1)||(Eat_16>=1))||(Eat_19>=1))||(Eat_18>=1))||(Eat_1>=1))||(Eat_0>=1))||(Eat_3>=1))||(Eat_2>=1))||(Eat_5>=1))||(Eat_4>=1))||(Eat_7>=1))||(Eat_6>=1))||(Eat_9>=1))||(Eat_8>=1))||(Eat_11>=1))||(Eat_10>=1))||(Eat_13>=1))||(Eat_12>=1))||(Eat_15>=1))||(Eat_14>=1))" | (G"(((((((((((((((((((((Think_0>=1)&&(Fork_0>=1))||((Think_5>=1)&&(Fork_5>=1)))||((Think_8>=1)&&(Fork_8>=1)))||((Think_13>=1)&&(Fork_13>=1)))||((Think_16>=1)&&(Fork_16>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_2>=1)&&(Fork_2>=1)))||((Think_6>=1)&&(Fork_6>=1)))||((Think_10>=1)&&(Fork_10>=1)))||((Think_14>=1)&&(Fork_14>=1)))||((Think_18>=1)&&(Fork_18>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Think_9>=1)&&(Fork_9>=1)))||((Think_12>=1)&&(Fork_12>=1)))||((Think_17>=1)&&(Fork_17>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Think_11>=1)&&(Fork_11>=1)))||((Think_15>=1)&&(Fork_15>=1)))||((Think_19>=1)&&(Fork_19>=1)))" U "(((((((((((((((((((((Think_5<1)||(Fork_4<1))&&((Think_13<1)||(Fork_12<1)))&&((Think_16<1)||(Fork_15<1)))&&((Think_18<1)||(Fork_17<1)))&&((Think_8<1)||(Fork_7<1)))&&((Think_10<1)||(Fork_9<1)))&&((Think_2<1)||(Fork_1<1)))&&((Think_3<1)||(Fork_2<1)))&&((Think_17<1)||(Fork_16<1)))&&((Think_9<1)||(Fork_8<1)))&&((Think_0<1)||(Fork_19<1)))&&((Think_14<1)||(Fork_13<1)))&&((Think_4<1)||(Fork_3<1)))&&((Think_6<1)||(Fork_5<1)))&&((Think_12<1)||(Fork_11<1)))&&((Think_1<1)||(Fork_0<1)))&&((Think_15<1)||(Fork_14<1)))&&((Think_19<1)||(Fork_18<1)))&&((Think_7<1)||(Fork_6<1)))&&((Think_11<1)||(Fork_10<1)))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2021-06-06 14:36:33] [INFO ] Flatten gal took : 13 ms
[2021-06-06 14:36:33] [INFO ] Applying decomposition
[2021-06-06 14:36:33] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph295219846160616375.txt, -o, /tmp/graph295219846160616375.bin, -w, /tmp/graph295219846160616375.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph295219846160616375.bin, -l, -1, -v, -w, /tmp/graph295219846160616375.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 14:36:34] [INFO ] Decomposing Gal with order
[2021-06-06 14:36:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 14:36:34] [INFO ] Removed a total of 20 redundant transitions.
[2021-06-06 14:36:34] [INFO ] Flatten gal took : 145 ms
[2021-06-06 14:36:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 6 ms.
[2021-06-06 14:36:34] [INFO ] Time to serialize gal into /tmp/LTL6062185107742916984.gal : 14 ms
[2021-06-06 14:36:34] [INFO ] Time to serialize properties into /tmp/LTL14149815822517194838.ltl : 2 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/LTL6062185107742916984.gal, -t, CGAL, -LTL, /tmp/LTL14149815822517194838.ltl, -c, -stutter-deadlock], 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/LTL6062185107742916984.gal -t CGAL -LTL /tmp/LTL14149815822517194838.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((X("((((((((((((((((((((i0.u2.Eat_17>=1)||(i0.u18.Eat_16>=1))||(i1.u3.Eat_19>=1))||(i0.u19.Eat_18>=1))||(i5.u5.Eat_1>=1))||(i1.u4.Eat_0>=1))||(i5.u0.Eat_3>=1))||(i5.u12.Eat_2>=1))||(i6.u6.Eat_5>=1))||(i6.u13.Eat_4>=1))||(i2.u14.Eat_7>=1))||(i2.u7.Eat_6>=1))||(i3.u15.Eat_9>=1))||(i3.u8.Eat_8>=1))||(i7.u10.Eat_11>=1))||(i7.u9.Eat_10>=1))||(i4.u17.Eat_13>=1))||(i7.u16.Eat_12>=1))||(i4.u11.Eat_15>=1))||(i4.u1.Eat_14>=1))"))U((X("(((((((((((((((((((((i6.u6.Think_5>=1)&&(i6.u6.Fork_4>=1))||((i4.u17.Think_13>=1)&&(i7.u16.Fork_12>=1)))||((i0.u18.Think_16>=1)&&(i4.u11.Fork_15>=1)))||((i0.u19.Think_18>=1)&&(i0.u19.Fork_17>=1)))||((i3.u8.Think_8>=1)&&(i3.u8.Fork_7>=1)))||((i7.u9.Think_10>=1)&&(i7.u9.Fork_9>=1)))||((i5.u12.Think_2>=1)&&(i5.u5.Fork_1>=1)))||((i5.u0.Think_3>=1)&&(i5.u12.Fork_2>=1)))||((i0.u2.Think_17>=1)&&(i0.u18.Fork_16>=1)))||((i3.u15.Think_9>=1)&&(i3.u15.Fork_8>=1)))||((i1.u4.Think_0>=1)&&(i1.u3.Fork_19>=1)))||((i4.u1.Think_14>=1)&&(i4.u17.Fork_13>=1)))||((i6.u13.Think_4>=1)&&(i6.u13.Fork_3>=1)))||((i2.u7.Think_6>=1)&&(i2.u7.Fork_5>=1)))||((i7.u16.Think_12>=1)&&(i7.u10.Fork_11>=1)))||((i5.u5.Think_1>=1)&&(i1.u4.Fork_0>=1)))||((i4.u11.Think_15>=1)&&(i4.u1.Fork_14>=1)))||((i1.u3.Think_19>=1)&&(i1.u3.Fork_18>=1)))||((i2.u14.Think_7>=1)&&(i2.u14.Fork_6>=1)))||((i7.u10.Think_11>=1)&&(i7.u9.Fork_10>=1)))"))&&("(((((((((((((((((((((i1.u4.Think_0>=1)&&(i1.u4.Fork_0>=1))||((i6.u6.Think_5>=1)&&(i2.u7.Fork_5>=1)))||((i3.u8.Think_8>=1)&&(i3.u15.Fork_8>=1)))||((i4.u17.Think_13>=1)&&(i4.u17.Fork_13>=1)))||((i0.u18.Think_16>=1)&&(i0.u18.Fork_16>=1)))||((i5.u0.Think_3>=1)&&(i6.u13.Fork_3>=1)))||((i5.u12.Think_2>=1)&&(i5.u12.Fork_2>=1)))||((i2.u7.Think_6>=1)&&(i2.u14.Fork_6>=1)))||((i7.u9.Think_10>=1)&&(i7.u9.Fork_10>=1)))||((i4.u1.Think_14>=1)&&(i4.u1.Fork_14>=1)))||((i0.u19.Think_18>=1)&&(i1.u3.Fork_18>=1)))||((i6.u13.Think_4>=1)&&(i6.u6.Fork_4>=1)))||((i3.u15.Think_9>=1)&&(i7.u9.Fork_9>=1)))||((i7.u16.Think_12>=1)&&(i7.u16.Fork_12>=1)))||((i0.u2.Think_17>=1)&&(i0.u19.Fork_17>=1)))||((i5.u5.Think_1>=1)&&(i5.u5.Fork_1>=1)))||((i2.u14.Think_7>=1)&&(i3.u8.Fork_7>=1)))||((i7.u10.Think_11>=1)&&(i7.u10.Fork_11>=1)))||((i4.u11.Think_15>=1)&&(i4.u11.Fork_15>=1)))||((i1.u3.Think_19>=1)&&(i1.u3.Fork_19>=1)))")))U(("((((((((((((((((((((i0.u2.Eat_17>=1)||(i0.u18.Eat_16>=1))||(i1.u3.Eat_19>=1))||(i0.u19.Eat_18>=1))||(i5.u5.Eat_1>=1))||(i1.u4.Eat_0>=1))||(i5.u0.Eat_3>=1))||(i5.u12.Eat_2>=1))||(i6.u6.Eat_5>=1))||(i6.u13.Eat_4>=1))||(i2.u14.Eat_7>=1))||(i2.u7.Eat_6>=1))||(i3.u15.Eat_9>=1))||(i3.u8.Eat_8>=1))||(i7.u10.Eat_11>=1))||(i7.u9.Eat_10>=1))||(i4.u17.Eat_13>=1))||(i7.u16.Eat_12>=1))||(i4.u11.Eat_15>=1))||(i4.u1.Eat_14>=1))")||((G("(((((((((((((((((((((i1.u4.Think_0>=1)&&(i1.u4.Fork_0>=1))||((i6.u6.Think_5>=1)&&(i2.u7.Fork_5>=1)))||((i3.u8.Think_8>=1)&&(i3.u15.Fork_8>=1)))||((i4.u17.Think_13>=1)&&(i4.u17.Fork_13>=1)))||((i0.u18.Think_16>=1)&&(i0.u18.Fork_16>=1)))||((i5.u0.Think_3>=1)&&(i6.u13.Fork_3>=1)))||((i5.u12.Think_2>=1)&&(i5.u12.Fork_2>=1)))||((i2.u7.Think_6>=1)&&(i2.u14.Fork_6>=1)))||((i7.u9.Think_10>=1)&&(i7.u9.Fork_10>=1)))||((i4.u1.Think_14>=1)&&(i4.u1.Fork_14>=1)))||((i0.u19.Think_18>=1)&&(i1.u3.Fork_18>=1)))||((i6.u13.Think_4>=1)&&(i6.u6.Fork_4>=1)))||((i3.u15.Think_9>=1)&&(i7.u9.Fork_9>=1)))||((i7.u16.Think_12>=1)&&(i7.u16.Fork_12>=1)))||((i0.u2.Think_17>=1)&&(i0.u19.Fork_17>=1)))||((i5.u5.Think_1>=1)&&(i5.u5.Fork_1>=1)))||((i2.u14.Think_7>=1)&&(i3.u8.Fork_7>=1)))||((i7.u10.Think_11>=1)&&(i7.u10.Fork_11>=1)))||((i4.u11.Think_15>=1)&&(i4.u11.Fork_15>=1)))||((i1.u3.Think_19>=1)&&(i1.u3.Fork_19>=1)))"))U("(((((((((((((((((((((i6.u6.Think_5<1)||(i6.u6.Fork_4<1))&&((i4.u17.Think_13<1)||(i7.u16.Fork_12<1)))&&((i0.u18.Think_16<1)||(i4.u11.Fork_15<1)))&&((i0.u19.Think_18<1)||(i0.u19.Fork_17<1)))&&((i3.u8.Think_8<1)||(i3.u8.Fork_7<1)))&&((i7.u9.Think_10<1)||(i7.u9.Fork_9<1)))&&((i5.u12.Think_2<1)||(i5.u5.Fork_1<1)))&&((i5.u0.Think_3<1)||(i5.u12.Fork_2<1)))&&((i0.u2.Think_17<1)||(i0.u18.Fork_16<1)))&&((i3.u15.Think_9<1)||(i3.u15.Fork_8<1)))&&((i1.u4.Think_0<1)||(i1.u3.Fork_19<1)))&&((i4.u1.Think_14<1)||(i4.u17.Fork_13<1)))&&((i6.u13.Think_4<1)||(i6.u13.Fork_3<1)))&&((i2.u7.Think_6<1)||(i2.u7.Fork_5<1)))&&((i7.u16.Think_12<1)||(i7.u10.Fork_11<1)))&&((i5.u5.Think_1<1)||(i1.u4.Fork_0<1)))&&((i4.u11.Think_15<1)||(i4.u1.Fork_14<1)))&&((i1.u3.Think_19<1)||(i1.u3.Fork_18<1)))&&((i2.u14.Think_7<1)||(i2.u14.Fork_6<1)))&&((i7.u10.Think_11<1)||(i7.u9.Fork_10<1)))")))))
Formula 0 simplified : !((X"((((((((((((((((((((i0.u2.Eat_17>=1)||(i0.u18.Eat_16>=1))||(i1.u3.Eat_19>=1))||(i0.u19.Eat_18>=1))||(i5.u5.Eat_1>=1))||(i1.u4.Eat_0>=1))||(i5.u0.Eat_3>=1))||(i5.u12.Eat_2>=1))||(i6.u6.Eat_5>=1))||(i6.u13.Eat_4>=1))||(i2.u14.Eat_7>=1))||(i2.u7.Eat_6>=1))||(i3.u15.Eat_9>=1))||(i3.u8.Eat_8>=1))||(i7.u10.Eat_11>=1))||(i7.u9.Eat_10>=1))||(i4.u17.Eat_13>=1))||(i7.u16.Eat_12>=1))||(i4.u11.Eat_15>=1))||(i4.u1.Eat_14>=1))" U ("(((((((((((((((((((((i1.u4.Think_0>=1)&&(i1.u4.Fork_0>=1))||((i6.u6.Think_5>=1)&&(i2.u7.Fork_5>=1)))||((i3.u8.Think_8>=1)&&(i3.u15.Fork_8>=1)))||((i4.u17.Think_13>=1)&&(i4.u17.Fork_13>=1)))||((i0.u18.Think_16>=1)&&(i0.u18.Fork_16>=1)))||((i5.u0.Think_3>=1)&&(i6.u13.Fork_3>=1)))||((i5.u12.Think_2>=1)&&(i5.u12.Fork_2>=1)))||((i2.u7.Think_6>=1)&&(i2.u14.Fork_6>=1)))||((i7.u9.Think_10>=1)&&(i7.u9.Fork_10>=1)))||((i4.u1.Think_14>=1)&&(i4.u1.Fork_14>=1)))||((i0.u19.Think_18>=1)&&(i1.u3.Fork_18>=1)))||((i6.u13.Think_4>=1)&&(i6.u6.Fork_4>=1)))||((i3.u15.Think_9>=1)&&(i7.u9.Fork_9>=1)))||((i7.u16.Think_12>=1)&&(i7.u16.Fork_12>=1)))||((i0.u2.Think_17>=1)&&(i0.u19.Fork_17>=1)))||((i5.u5.Think_1>=1)&&(i5.u5.Fork_1>=1)))||((i2.u14.Think_7>=1)&&(i3.u8.Fork_7>=1)))||((i7.u10.Think_11>=1)&&(i7.u10.Fork_11>=1)))||((i4.u11.Think_15>=1)&&(i4.u11.Fork_15>=1)))||((i1.u3.Think_19>=1)&&(i1.u3.Fork_19>=1)))" & X"(((((((((((((((((((((i6.u6.Think_5>=1)&&(i6.u6.Fork_4>=1))||((i4.u17.Think_13>=1)&&(i7.u16.Fork_12>=1)))||((i0.u18.Think_16>=1)&&(i4.u11.Fork_15>=1)))||((i0.u19.Think_18>=1)&&(i0.u19.Fork_17>=1)))||((i3.u8.Think_8>=1)&&(i3.u8.Fork_7>=1)))||((i7.u9.Think_10>=1)&&(i7.u9.Fork_9>=1)))||((i5.u12.Think_2>=1)&&(i5.u5.Fork_1>=1)))||((i5.u0.Think_3>=1)&&(i5.u12.Fork_2>=1)))||((i0.u2.Think_17>=1)&&(i0.u18.Fork_16>=1)))||((i3.u15.Think_9>=1)&&(i3.u15.Fork_8>=1)))||((i1.u4.Think_0>=1)&&(i1.u3.Fork_19>=1)))||((i4.u1.Think_14>=1)&&(i4.u17.Fork_13>=1)))||((i6.u13.Think_4>=1)&&(i6.u13.Fork_3>=1)))||((i2.u7.Think_6>=1)&&(i2.u7.Fork_5>=1)))||((i7.u16.Think_12>=1)&&(i7.u10.Fork_11>=1)))||((i5.u5.Think_1>=1)&&(i1.u4.Fork_0>=1)))||((i4.u11.Think_15>=1)&&(i4.u1.Fork_14>=1)))||((i1.u3.Think_19>=1)&&(i1.u3.Fork_18>=1)))||((i2.u14.Think_7>=1)&&(i2.u14.Fork_6>=1)))||((i7.u10.Think_11>=1)&&(i7.u9.Fork_10>=1)))")) U ("((((((((((((((((((((i0.u2.Eat_17>=1)||(i0.u18.Eat_16>=1))||(i1.u3.Eat_19>=1))||(i0.u19.Eat_18>=1))||(i5.u5.Eat_1>=1))||(i1.u4.Eat_0>=1))||(i5.u0.Eat_3>=1))||(i5.u12.Eat_2>=1))||(i6.u6.Eat_5>=1))||(i6.u13.Eat_4>=1))||(i2.u14.Eat_7>=1))||(i2.u7.Eat_6>=1))||(i3.u15.Eat_9>=1))||(i3.u8.Eat_8>=1))||(i7.u10.Eat_11>=1))||(i7.u9.Eat_10>=1))||(i4.u17.Eat_13>=1))||(i7.u16.Eat_12>=1))||(i4.u11.Eat_15>=1))||(i4.u1.Eat_14>=1))" | (G"(((((((((((((((((((((i1.u4.Think_0>=1)&&(i1.u4.Fork_0>=1))||((i6.u6.Think_5>=1)&&(i2.u7.Fork_5>=1)))||((i3.u8.Think_8>=1)&&(i3.u15.Fork_8>=1)))||((i4.u17.Think_13>=1)&&(i4.u17.Fork_13>=1)))||((i0.u18.Think_16>=1)&&(i0.u18.Fork_16>=1)))||((i5.u0.Think_3>=1)&&(i6.u13.Fork_3>=1)))||((i5.u12.Think_2>=1)&&(i5.u12.Fork_2>=1)))||((i2.u7.Think_6>=1)&&(i2.u14.Fork_6>=1)))||((i7.u9.Think_10>=1)&&(i7.u9.Fork_10>=1)))||((i4.u1.Think_14>=1)&&(i4.u1.Fork_14>=1)))||((i0.u19.Think_18>=1)&&(i1.u3.Fork_18>=1)))||((i6.u13.Think_4>=1)&&(i6.u6.Fork_4>=1)))||((i3.u15.Think_9>=1)&&(i7.u9.Fork_9>=1)))||((i7.u16.Think_12>=1)&&(i7.u16.Fork_12>=1)))||((i0.u2.Think_17>=1)&&(i0.u19.Fork_17>=1)))||((i5.u5.Think_1>=1)&&(i5.u5.Fork_1>=1)))||((i2.u14.Think_7>=1)&&(i3.u8.Fork_7>=1)))||((i7.u10.Think_11>=1)&&(i7.u10.Fork_11>=1)))||((i4.u11.Think_15>=1)&&(i4.u11.Fork_15>=1)))||((i1.u3.Think_19>=1)&&(i1.u3.Fork_19>=1)))" U "(((((((((((((((((((((i6.u6.Think_5<1)||(i6.u6.Fork_4<1))&&((i4.u17.Think_13<1)||(i7.u16.Fork_12<1)))&&((i0.u18.Think_16<1)||(i4.u11.Fork_15<1)))&&((i0.u19.Think_18<1)||(i0.u19.Fork_17<1)))&&((i3.u8.Think_8<1)||(i3.u8.Fork_7<1)))&&((i7.u9.Think_10<1)||(i7.u9.Fork_9<1)))&&((i5.u12.Think_2<1)||(i5.u5.Fork_1<1)))&&((i5.u0.Think_3<1)||(i5.u12.Fork_2<1)))&&((i0.u2.Think_17<1)||(i0.u18.Fork_16<1)))&&((i3.u15.Think_9<1)||(i3.u15.Fork_8<1)))&&((i1.u4.Think_0<1)||(i1.u3.Fork_19<1)))&&((i4.u1.Think_14<1)||(i4.u17.Fork_13<1)))&&((i6.u13.Think_4<1)||(i6.u13.Fork_3<1)))&&((i2.u7.Think_6<1)||(i2.u7.Fork_5<1)))&&((i7.u16.Think_12<1)||(i7.u10.Fork_11<1)))&&((i5.u5.Think_1<1)||(i1.u4.Fork_0<1)))&&((i4.u11.Think_15<1)||(i4.u1.Fork_14<1)))&&((i1.u3.Think_19<1)||(i1.u3.Fork_18<1)))&&((i2.u14.Think_7<1)||(i2.u14.Fork_6<1)))&&((i7.u10.Think_11<1)||(i7.u9.Fork_10<1)))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17298700480409072974
[2021-06-06 14:36:49] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17298700480409072974
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17298700480409072974]
Compilation finished in 880 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17298700480409072974]
Link finished in 82 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ((X((LTLAPp0==true)) U (X((LTLAPp1==true))&&(LTLAPp2==true))) U (([]((LTLAPp2==true)) U !(LTLAPp1==true))||(LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin17298700480409072974]
LTSmin run took 506 ms.
FORMULA Philosophers-COL-000020-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Philosophers-COL-000020-15 finished in 38654 ms.
All properties solved without resorting to model-checking.

BK_STOP 1622990212096

--------------------
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-COL-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-COL-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-162298995800013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000020.tgz
mv Philosophers-COL-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 '' 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 ;