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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.4K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K 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 9.7K 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-000005-00
FORMULA_NAME Philosophers-COL-000005-01
FORMULA_NAME Philosophers-COL-000005-02
FORMULA_NAME Philosophers-COL-000005-03
FORMULA_NAME Philosophers-COL-000005-04
FORMULA_NAME Philosophers-COL-000005-05
FORMULA_NAME Philosophers-COL-000005-06
FORMULA_NAME Philosophers-COL-000005-07
FORMULA_NAME Philosophers-COL-000005-08
FORMULA_NAME Philosophers-COL-000005-09
FORMULA_NAME Philosophers-COL-000005-10
FORMULA_NAME Philosophers-COL-000005-11
FORMULA_NAME Philosophers-COL-000005-12
FORMULA_NAME Philosophers-COL-000005-13
FORMULA_NAME Philosophers-COL-000005-14
FORMULA_NAME Philosophers-COL-000005-15

=== Now, execution of the tool begins

BK_START 1623437569393

Running Version 0
[2021-06-11 18:52:50] [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-11 18:52:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-11 18:52:50] [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-11 18:52:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-06-11 18:52:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 503 ms
[2021-06-11 18:52:51] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 25 PT places and 25.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-06-11 18:52:51] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions in 5 ms.
[2021-06-11 18:52:51] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_11730121148311061297.dot
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2021-06-11 18:52:51] [INFO ] Flatten gal took : 15 ms
[2021-06-11 18:52:51] [INFO ] Flatten gal took : 1 ms
[2021-06-11 18:52:51] [INFO ] Unfolded HLPN to a Petri net with 25 places and 25 transitions in 2 ms.
[2021-06-11 18:52:51] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_6467338371454100694.dot
[2021-06-11 18:52:51] [INFO ] Initial state test concluded for 2 properties.
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 6 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:51] [INFO ] Computed 10 place invariants in 8 ms
[2021-06-11 18:52:51] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:51] [INFO ] Computed 10 place invariants in 8 ms
[2021-06-11 18:52:51] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:51] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:51] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
[2021-06-11 18:52:51] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-06-11 18:52:51] [INFO ] Flatten gal took : 9 ms
FORMULA Philosophers-COL-000005-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-11 18:52:51] [INFO ] Flatten gal took : 6 ms
[2021-06-11 18:52:51] [INFO ] Input system was already deterministic with 25 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 11 properties in 2 ms. (steps per millisecond=3 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((((p1 U p2)&&p0) U !p1))))], workingDir=/home/mcc/execution]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 13 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:52] [INFO ] Computed 10 place invariants in 3 ms
[2021-06-11 18:52:52] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:52] [INFO ] Computed 10 place invariants in 8 ms
[2021-06-11 18:52:52] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2021-06-11 18:52:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:52] [INFO ] Computed 10 place invariants in 5 ms
[2021-06-11 18:52:52] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 265 ms :[p1, p1, (AND p1 (NOT p2))]
Running random walk in product with property : Philosophers-COL-000005-01 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s4 1) (GEQ s9 1)) (AND (GEQ s1 1) (GEQ s6 1)) (AND (GEQ s3 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s7 1))), p0:(AND (LT s20 1) (LT s21 1) (LT s22 1) (LT s23 1) (LT s24 1)), p2:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 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 13108 reset in 315 ms.
Stack based approach found an accepted trace after 79 steps with 11 reset with depth 11 and stack size 11 in 0 ms.
FORMULA Philosophers-COL-000005-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-01 finished in 858 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((!p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:52] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:52] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:52] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:52] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:52] [INFO ] Computed 10 place invariants in 2 ms
[2021-06-11 18:52:53] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Philosophers-COL-000005-02 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (OR (LT s7 1) (LT s18 1)) (OR (LT s5 1) (LT s16 1)) (OR (LT s9 1) (LT s15 1)) (OR (LT s6 1) (LT s17 1)) (OR (LT s8 1) (LT s19 1))), p0:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Product exploration explored 100000 steps with 50000 reset in 200 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 15 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2021-06-11 18:52:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:54] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:54] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Product exploration explored 100000 steps with 50000 reset in 285 ms.
Product exploration explored 100000 steps with 50000 reset in 279 ms.
[2021-06-11 18:52:54] [INFO ] Flatten gal took : 4 ms
[2021-06-11 18:52:54] [INFO ] Flatten gal took : 3 ms
[2021-06-11 18:52:54] [INFO ] Time to serialize gal into /tmp/LTL11111134876160441651.gal : 1 ms
[2021-06-11 18:52:54] [INFO ] Time to serialize properties into /tmp/LTL1738050383140334359.ltl : 14 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/LTL11111134876160441651.gal, -t, CGAL, -LTL, /tmp/LTL1738050383140334359.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/LTL11111134876160441651.gal -t CGAL -LTL /tmp/LTL1738050383140334359.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((((((Fork_2<1)||(Catch2_3<1))&&((Fork_0<1)||(Catch2_1<1)))&&((Fork_4<1)||(Catch2_0<1)))&&((Fork_1<1)||(Catch2_2<1)))&&((Fork_3<1)||(Catch2_4<1)))"))||("(((((Eat_0<1)&&(Eat_1<1))&&(Eat_2<1))&&(Eat_3<1))&&(Eat_4<1))")))))
Formula 0 simplified : !XF("(((((Eat_0<1)&&(Eat_1<1))&&(Eat_2<1))&&(Eat_3<1))&&(Eat_4<1))" | G"((((((Fork_2<1)||(Catch2_3<1))&&((Fork_0<1)||(Catch2_1<1)))&&((Fork_4<1)||(Catch2_0<1)))&&((Fork_1<1)||(Catch2_2<1)))&&((Fork_3<1)||(Catch2_4<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
0 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.025678,16784,1,0,8,1772,30,3,645,697,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Philosophers-COL-000005-02 finished in 1907 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:54] [INFO ] Computed 10 place invariants in 3 ms
[2021-06-11 18:52:54] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:54] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:54] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:54] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:54] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000005-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1)), p1:(AND (OR (LT s4 1) (LT s8 1)) (OR (LT s1 1) (LT s5 1)) (OR (LT s3 1) (LT s7 1)) (OR (LT s2 1) (LT s6 1)) (OR (LT s0 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000005-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-03 finished in 238 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:55] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:55] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2021-06-11 18:52:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 2 ms
[2021-06-11 18:52:55] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000005-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} 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=[p1:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1)), p0:(AND (OR (LT s4 1) (LT s8 1)) (OR (LT s1 1) (LT s5 1)) (OR (LT s3 1) (LT s7 1)) (OR (LT s2 1) (LT s6 1)) (OR (LT s0 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 15643 reset in 219 ms.
Stack based approach found an accepted trace after 45 steps with 5 reset with depth 8 and stack size 8 in 0 ms.
FORMULA Philosophers-COL-000005-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-04 finished in 417 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||G(p1)))||X(X(X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:55] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:55] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:55] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 385 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : Philosophers-COL-000005-05 automaton TGBA [mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 10}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 12}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 10}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 12}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 10}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 12}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 8}, { cond=p0, acceptance={} source=6 dest: 9}], [{ cond=true, acceptance={} source=7 dest: 11}], [{ cond=p1, acceptance={} source=8 dest: 4}, { cond=(NOT p1), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 4}, { cond=p0, acceptance={} source=9 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 11}], [{ cond=true, acceptance={0} source=10 dest: 10}], [{ cond=true, acceptance={} source=11 dest: 12}], [{ cond=(NOT p2), acceptance={} source=12 dest: 10}, { cond=p2, acceptance={} source=12 dest: 12}]], initial=6, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s4 1) (GEQ s9 1)) (AND (GEQ s1 1) (GEQ s6 1)) (AND (GEQ s3 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s7 1))), p2:(OR (AND (LT s20 1) (LT s21 1) (LT s22 1) (LT s23 1) (LT s24 1)) (AND (OR (LT s0 1) (LT s5 1)) (OR (LT s4 1) (LT s9 1)) (OR (LT s1 1) (LT s6 1)) (OR (LT s3 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1)))), p0:(AND (OR (LT s8 1) (LT s13 1)) (OR (LT s9 1) (LT s14 1)) (OR (LT s5 1) (LT s10 1)) (OR (LT s6 1) (LT s11 1)) (OR (LT s7 1) (LT s12 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, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000005-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-05 finished in 481 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(!p0) U (!p1&&X(!p1))))], workingDir=/home/mcc/execution]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:55] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:55] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:55] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 130 ms :[p1, true, p1, p0, p1]
Running random walk in product with property : Philosophers-COL-000005-06 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s7 1) (LT s18 1)) (OR (LT s5 1) (LT s16 1)) (OR (LT s9 1) (LT s15 1)) (OR (LT s6 1) (LT s17 1)) (OR (LT s8 1) (LT s19 1))), p0:(AND (OR (LT s4 1) (LT s8 1)) (OR (LT s1 1) (LT s5 1)) (OR (LT s3 1) (LT s7 1)) (OR (LT s2 1) (LT s6 1)) (OR (LT s0 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000005-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-06 finished in 200 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(!p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:56] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:56] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:56] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:56] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2021-06-11 18:52:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:56] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:56] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : Philosophers-COL-000005-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s7 1) (LT s18 1)) (OR (LT s5 1) (LT s16 1)) (OR (LT s9 1) (LT s15 1)) (OR (LT s6 1) (LT s17 1)) (OR (LT s8 1) (LT s19 1))), p0:(OR (AND (GEQ s8 1) (GEQ s13 1)) (AND (GEQ s9 1) (GEQ s14 1)) (AND (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s6 1) (GEQ s11 1)) (AND (GEQ s7 1) (GEQ s12 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 22 steps with 1 reset in 0 ms.
FORMULA Philosophers-COL-000005-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-07 finished in 140 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:56] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:56] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:56] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:56] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2021-06-11 18:52:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:56] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:56] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000005-08 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (LT s7 1) (LT s18 1)) (OR (LT s5 1) (LT s16 1)) (OR (LT s9 1) (LT s15 1)) (OR (LT s6 1) (LT s17 1)) (OR (LT s8 1) (LT s19 1))), p0:(AND (OR (LT s4 1) (LT s8 1)) (OR (LT s1 1) (LT s5 1)) (OR (LT s3 1) (LT s7 1)) (OR (LT s2 1) (LT s6 1)) (OR (LT s0 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 16275 reset in 177 ms.
Stack based approach found an accepted trace after 128 steps with 22 reset with depth 7 and stack size 7 in 1 ms.
FORMULA Philosophers-COL-000005-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-08 finished in 270 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:56] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:56] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:56] [INFO ] Computed 10 place invariants in 6 ms
[2021-06-11 18:52:56] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:56] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:56] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, p0, p0]
Running random walk in product with property : Philosophers-COL-000005-09 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 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 4 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000005-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-09 finished in 147 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0)&&G((!p1||(p2 U (p3||G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:56] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:56] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:56] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:56] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:56] [INFO ] Computed 10 place invariants in 2 ms
[2021-06-11 18:52:56] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (AND p1 (NOT p2) (NOT p3))), (OR (NOT p0) (AND p1 (NOT p2) (NOT p3))), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2) (AND (NOT p0) p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) p1)]
Running random walk in product with property : Philosophers-COL-000005-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p1) p3 p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=1 dest: 4}, { cond=(OR (NOT p1) p3 p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND p3 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=5 dest: 4}, { cond=(OR (NOT p1) p3 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1)), p3:(AND (OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s4 1) (GEQ s9 1)) (AND (GEQ s1 1) (GEQ s6 1)) (AND (GEQ s3 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s7 1))) (OR (LT s7 1) (LT s18 1)) (OR (LT s5 1) (LT s16 1)) (OR (LT s9 1) (LT s15 1)) (OR (LT s6 1) (LT s17 1)) (OR (LT s8 1) (LT s19 1))), p2:(AND (OR (LT s7 1) (LT s18 1)) (OR (LT s5 1) (LT s16 1)) (OR (LT s9 1) (LT s15 1)) (OR (LT s6 1) (LT s17 1)) (OR (LT s8 1) (LT s19 1))), p0:(OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s4 1) (GEQ s9 1)) (AND (GEQ s1 1) (GEQ s6 1)) (AND (GEQ s3 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000005-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-10 finished in 273 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(!p0)))))], workingDir=/home/mcc/execution]
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:56] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:56] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:56] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:56] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:56] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:57] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 241 ms :[p0, p0, p0, p0]
Running random walk in product with property : Philosophers-COL-000005-11 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s4 1) (LT s8 1)) (OR (LT s1 1) (LT s5 1)) (OR (LT s3 1) (LT s7 1)) (OR (LT s2 1) (LT s6 1)) (OR (LT s0 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 20 steps with 3 reset in 0 ms.
FORMULA Philosophers-COL-000005-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-11 finished in 304 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(p0)||(F(p2)&&p1))))], workingDir=/home/mcc/execution]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:57] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:57] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:57] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:57] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:57] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:57] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Philosophers-COL-000005-12 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s4 1) (LT s8 1)) (OR (LT s1 1) (LT s5 1)) (OR (LT s3 1) (LT s7 1)) (OR (LT s2 1) (LT s6 1)) (OR (LT s0 1) (LT s9 1))), p2:(AND (OR (LT s4 1) (LT s8 1)) (OR (LT s1 1) (LT s5 1)) (OR (LT s3 1) (LT s7 1)) (OR (LT s2 1) (LT s6 1)) (OR (LT s0 1) (LT s9 1))), p0:(AND (OR (LT s7 1) (LT s18 1)) (OR (LT s5 1) (LT s16 1)) (OR (LT s9 1) (LT s15 1)) (OR (LT s6 1) (LT s17 1)) (OR (LT s8 1) (LT s19 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 30912 reset in 123 ms.
Stack based approach found an accepted trace after 541 steps with 169 reset with depth 4 and stack size 4 in 0 ms.
FORMULA Philosophers-COL-000005-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-12 finished in 288 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(!p0)))))], workingDir=/home/mcc/execution]
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:57] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:57] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:57] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:57] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:57] [INFO ] Computed 10 place invariants in 2 ms
[2021-06-11 18:52:57] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 117 ms :[p0, p0, p0, p0]
Running random walk in product with property : Philosophers-COL-000005-13 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s4 1) (GEQ s9 1)) (AND (GEQ s1 1) (GEQ s6 1)) (AND (GEQ s3 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 16353 reset in 98 ms.
Stack based approach found an accepted trace after 111 steps with 18 reset with depth 6 and stack size 6 in 0 ms.
FORMULA Philosophers-COL-000005-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-13 finished in 285 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:57] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:57] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:57] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:57] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-06-11 18:52:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:57] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:57] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000005-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (LT s4 1) (LT s8 1)) (OR (LT s1 1) (LT s5 1)) (OR (LT s3 1) (LT s7 1)) (OR (LT s2 1) (LT s6 1)) (OR (LT s0 1) (LT s9 1))), p0:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 20787 reset in 118 ms.
Product exploration explored 100000 steps with 20811 reset in 128 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 20753 reset in 116 ms.
Product exploration explored 100000 steps with 20782 reset in 137 ms.
[2021-06-11 18:52:58] [INFO ] Flatten gal took : 2 ms
[2021-06-11 18:52:58] [INFO ] Flatten gal took : 2 ms
[2021-06-11 18:52:58] [INFO ] Time to serialize gal into /tmp/LTL16156552092677946459.gal : 1 ms
[2021-06-11 18:52:58] [INFO ] Time to serialize properties into /tmp/LTL12924653531178478367.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16156552092677946459.gal, -t, CGAL, -LTL, /tmp/LTL12924653531178478367.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/LTL16156552092677946459.gal -t CGAL -LTL /tmp/LTL12924653531178478367.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(((((Eat_0>=1)||(Eat_1>=1))||(Eat_2>=1))||(Eat_3>=1))||(Eat_4>=1))")||(G("((((((Think_4<1)||(Fork_3<1))&&((Think_1<1)||(Fork_0<1)))&&((Think_3<1)||(Fork_2<1)))&&((Think_2<1)||(Fork_1<1)))&&((Think_0<1)||(Fork_4<1)))")))))
Formula 0 simplified : !F("(((((Eat_0>=1)||(Eat_1>=1))||(Eat_2>=1))||(Eat_3>=1))||(Eat_4>=1))" | G"((((((Think_4<1)||(Fork_3<1))&&((Think_1<1)||(Fork_0<1)))&&((Think_3<1)||(Fork_2<1)))&&((Think_2<1)||(Fork_1<1)))&&((Think_0<1)||(Fork_4<1)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
2 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.03186,17352,1,0,43,4673,29,31,650,6393,103
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Philosophers-COL-000005-14 finished in 778 ms.
All properties solved without resorting to model-checking.

BK_STOP 1623437579670

--------------------
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-000005"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Philosophers-COL-000005, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162298995900204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;