Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 7.9K Apr 30 07:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 30 07:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 30 07:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 07:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 31K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652834785765

Running Version 202205111006
[2022-05-18 00:46:26] [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]
[2022-05-18 00:46:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 00:46:27] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-18 00:46:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 00:46:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 593 ms
[2022-05-18 00:46:27] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 30 PT places and 87.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2022-05-18 00:46:27] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 9 ms.
[2022-05-18 00:46:27] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PhilosophersDyn-COL-03-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 2542 steps, including 344 resets, run visited all 8 properties in 39 ms. (steps per millisecond=65 )
[2022-05-18 00:46:27] [INFO ] Flatten gal took : 19 ms
[2022-05-18 00:46:27] [INFO ] Flatten gal took : 3 ms
Domain [Philosopher(3), Philosopher(3)] of place Neighbourhood breaks symmetries in sort Philosopher
[2022-05-18 00:46:27] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions 564 arcs in 11 ms.
[2022-05-18 00:46:27] [INFO ] Unfolded 12 HLPN properties in 0 ms.
[2022-05-18 00:46:27] [INFO ] Reduced 5 identical enabling conditions.
[2022-05-18 00:46:27] [INFO ] Reduced 5 identical enabling conditions.
[2022-05-18 00:46:27] [INFO ] Reduced 5 identical enabling conditions.
[2022-05-18 00:46:27] [INFO ] Reduced 5 identical enabling conditions.
[2022-05-18 00:46:27] [INFO ] Reduced 5 identical enabling conditions.
[2022-05-18 00:46:27] [INFO ] Reduced 5 identical enabling conditions.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2022-05-18 00:46:28] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2022-05-18 00:46:28] [INFO ] Computed 11 place invariants in 7 ms
[2022-05-18 00:46:28] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 30 transitions.
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:28] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:28] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:28] [INFO ] Computed 11 place invariants in 20 ms
[2022-05-18 00:46:28] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:28] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/81 transitions.
Support contains 30 out of 30 places after structural reductions.
[2022-05-18 00:46:28] [INFO ] Flatten gal took : 16 ms
[2022-05-18 00:46:28] [INFO ] Flatten gal took : 22 ms
[2022-05-18 00:46:28] [INFO ] Input system was already deterministic with 51 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 10 properties in 2 ms. (steps per millisecond=3 )
FORMULA PhilosophersDyn-COL-03-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:28] [INFO ] Computed 11 place invariants in 7 ms
[2022-05-18 00:46:28] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:28] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-18 00:46:28] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:29] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-18 00:46:29] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:29] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:29] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:46:29] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s10 1) (GEQ s16 2)) (AND (GEQ s5 1) (GEQ s10 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s8 1) (GEQ s9 1) (GEQ s17 2)) (AND (GEQ s0 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-00 finished in 551 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(p0) U !(F(p0) U !F(p0))))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 10 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:29] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:46:29] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:29] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:29] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:29] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:29] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:29] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2022-05-18 00:46:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:29] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:29] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 29 ms :[p0]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s6 1) (GEQ s15 1) (GEQ s23 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s8 1) (GEQ s17...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 14311 reset in 336 ms.
Stack based approach found an accepted trace after 9 steps with 1 reset with depth 5 and stack size 5 in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-02 finished in 575 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U F(p1)))'
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:29] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:30] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:30] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:30] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:30] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:46:30] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:30] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2022-05-18 00:46:30] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:30] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:30] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (GEQ s17 1) (GEQ s20 1)) (AND (GEQ s16 1) (GEQ s19 1)) (AND (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s4 1) (GEQ s10 1) (GEQ s16 2)) (AND (GEQ s5 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 50000 reset in 212 ms.
Product exploration explored 100000 steps with 50000 reset in 224 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PhilosophersDyn-COL-03-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-03-LTLFireability-04 finished in 773 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:30] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:30] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:30] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:46:30] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:30] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:30] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:30] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:30] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:46:30] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s12 1) (GEQ s13 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PhilosophersDyn-COL-03-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-03-LTLFireability-05 finished in 647 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&G((F(X(p2))||p1))))'
Support contains 21 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:31] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:46:31] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:31] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:31] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:31] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:31] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:31] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:31] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s4 1) (GEQ s10 1) (GEQ s16 2)) (AND (GEQ s5 1) (GEQ s10 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s8 1) (GEQ s9 1) (GEQ s17 2)) (AND (GEQ s0 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-06 finished in 428 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!(p0 U (G(p1)||(p2 U p3))))))'
Support contains 21 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:31] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 00:46:31] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:31] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:31] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:31] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:46:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:31] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:31] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 00:46:32] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR p1 p3), (OR p1 p3), p3, p1]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=p3, acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={1} source=1 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=p3, acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={1} source=2 dest: 2}], [{ cond=p1, acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s10 1) (GEQ s16 2)) (AND (GEQ s5 1) (GEQ s10 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s8 1) (GEQ s9 1) (GEQ s17 2)) (AND (GEQ s0 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 15686 reset in 332 ms.
Stack based approach found an accepted trace after 35 steps with 5 reset with depth 6 and stack size 6 in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-07 finished in 739 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(p0)))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:32] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:32] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:32] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:32] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:32] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 00:46:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:32] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2022-05-18 00:46:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:32] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:32] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s12 1) (GEQ s13 1) (GEQ s14 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 4 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-08 finished in 244 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(G(p1))&&X(F(p0)))))'
Support contains 21 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:32] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:32] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:32] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-18 00:46:32] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:32] [INFO ] Computed 11 place invariants in 8 ms
[2022-05-18 00:46:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:32] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:32] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:32] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s10 1) (GEQ s16 2)) (AND (GEQ s5 1) (GEQ s10 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s8 1) (GEQ s9 1) (GEQ s17 2)) (AND (GEQ s0 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-11 finished in 453 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U (G(p1)&&F(X(X(p0))))))))'
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:33] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:33] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:33] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 00:46:33] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:33] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 00:46:33] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:33] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2022-05-18 00:46:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:33] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:46:33] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 398 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 2} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1, 2} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p1 p0), acceptance={1, 2} source=0 dest: 6}, { cond=(AND p1 p0), acceptance={} source=0 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 2} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1, 2} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0), acceptance={2} source=1 dest: 5}, { cond=(AND p1 p0), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 2} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1, 2} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p0), acceptance={1, 2} source=2 dest: 6}, { cond=(AND p1 p0), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 2} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1, 2} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={1, 2} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 2} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1, 2} source=5 dest: 3}, { cond=(AND p1 p0), acceptance={2} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 2} source=6 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=6 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1, 2} source=6 dest: 3}, { cond=(AND p1 p0), acceptance={1, 2} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=8 dest: 8}]], initial=0, aps=[p1:(OR (AND (GEQ s4 1) (GEQ s10 1) (GEQ s16 2)) (AND (GEQ s5 1) (GEQ s10 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s8 1) (GEQ s9 1) (GEQ s17 2)) (AND (GEQ s0 ...], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-12 finished in 602 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U (p0 U p0))||!(G(p1) U !p1))))'
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:33] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 00:46:33] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:33] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 00:46:33] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:33] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:33] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:33] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:34] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:46:34] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), true]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s11 1)), p1:(OR (AND (GEQ s2 1) (GEQ s3 1) (GEQ s12 1) (GEQ s15 1)) (AND (GEQ s8 2) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Product exploration explored 100000 steps with 50000 reset in 129 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PhilosophersDyn-COL-03-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-03-LTLFireability-13 finished in 700 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(F(p1)&&F(p2))))'
Support contains 27 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:34] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 00:46:34] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:34] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:34] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:34] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:34] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:34] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 00:46:34] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s17 1) (GEQ s20 1)) (AND (GEQ s16 1) (GEQ s19 1)) (AND (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s4 1) (GEQ s10 1) (GEQ s16 2)) (AND (GEQ s5 1) ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 255 ms.
Product exploration explored 100000 steps with 50000 reset in 249 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA PhilosophersDyn-COL-03-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-03-LTLFireability-15 finished in 1017 ms.
All properties solved by simple procedures.
Total runtime 8655 ms.

BK_STOP 1652834795675

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-COL-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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