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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 8.4K Apr 29 11:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 11:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 29 11:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 11:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.5K May 9 08:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 9 08:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 9 08:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K May 9 08:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 22K 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 Philosophers-PT-000005-LTLFireability-00
FORMULA_NAME Philosophers-PT-000005-LTLFireability-01
FORMULA_NAME Philosophers-PT-000005-LTLFireability-02
FORMULA_NAME Philosophers-PT-000005-LTLFireability-03
FORMULA_NAME Philosophers-PT-000005-LTLFireability-04
FORMULA_NAME Philosophers-PT-000005-LTLFireability-05
FORMULA_NAME Philosophers-PT-000005-LTLFireability-06
FORMULA_NAME Philosophers-PT-000005-LTLFireability-07
FORMULA_NAME Philosophers-PT-000005-LTLFireability-08
FORMULA_NAME Philosophers-PT-000005-LTLFireability-09
FORMULA_NAME Philosophers-PT-000005-LTLFireability-10
FORMULA_NAME Philosophers-PT-000005-LTLFireability-11
FORMULA_NAME Philosophers-PT-000005-LTLFireability-12
FORMULA_NAME Philosophers-PT-000005-LTLFireability-13
FORMULA_NAME Philosophers-PT-000005-LTLFireability-14
FORMULA_NAME Philosophers-PT-000005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652821647660

Running Version 202205111006
[2022-05-17 21:07:28] [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-17 21:07:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 21:07:29] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2022-05-17 21:07:29] [INFO ] Transformed 25 places.
[2022-05-17 21:07:29] [INFO ] Transformed 25 transitions.
[2022-05-17 21:07:29] [INFO ] Found NUPN structural information;
[2022-05-17 21:07:29] [INFO ] Parsed PT model containing 25 places and 25 transitions in 163 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Philosophers-PT-000005-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 8 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:29] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-17 21:07:29] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:29] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-17 21:07:29] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:29] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-17 21:07:29] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Support contains 22 out of 25 places after structural reductions.
[2022-05-17 21:07:29] [INFO ] Flatten gal took : 18 ms
[2022-05-17 21:07:29] [INFO ] Flatten gal took : 5 ms
[2022-05-17 21:07:29] [INFO ] Input system was already deterministic with 25 transitions.
Finished random walk after 98 steps, including 3 resets, run visited all 20 properties in 34 ms. (steps per millisecond=2 )
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' '!(F((G(p0)||G(p1))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 5 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:30] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 21:07:30] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:30] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-17 21:07:30] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2022-05-17 21:07:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:30] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 21:07:30] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s8 1) (EQ s14 1)) (AND (EQ s9 1) (EQ s13 1)) (AND (EQ s5 1) (EQ s10 1)) (AND (EQ s6 1) (EQ s11 1)) (AND (EQ s7 1) (EQ s12 1))), p1:(OR (AN...], nbAcceptance=2, 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 17 steps with 0 reset in 3 ms.
FORMULA Philosophers-PT-000005-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-00 finished in 376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-17 21:07:30] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 21:07:30] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:30] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-17 21:07:30] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:30] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 21:07:30] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (EQ s8 1) (EQ s14 1)) (AND (EQ s9 1) (EQ s13 1)) (AND (EQ s5 1) (EQ s10 1)) (AND (EQ s6 1) (EQ s11 1)) (AND (EQ s7 1) (EQ s12 1))), p0:(OR (AN...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000005-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-02 finished in 292 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(p0))))'
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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
[2022-05-17 21:07:30] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 21:07:30] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:30] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 21:07:30] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-05-17 21:07:30] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:30] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 21:07:30] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (EQ s4 0) (EQ s8 0)) (OR (EQ s1 0) (EQ s5 0)) (OR (EQ s3 0) (EQ s7 0)) (OR (EQ s2 0) (EQ s6 0)) (OR (EQ s0 0) (EQ s9 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15633 reset in 259 ms.
Stack based approach found an accepted trace after 38 steps with 5 reset with depth 9 and stack size 9 in 1 ms.
FORMULA Philosophers-PT-000005-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-03 finished in 464 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U !X((F(p1)||p2))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-17 21:07:31] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 21:07:31] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:31] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 21:07:31] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:31] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 21:07:31] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 322 ms :[(OR p2 p1), (OR p2 p1), (AND (NOT p1) p2), (OR p2 p1), true, p1, (NOT p1), p1]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(OR p1 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 2}, { cond=(OR p1 (AND p0 p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}], [{ cond=p1, acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(OR (AND (EQ s8 1) (EQ s14 1)) (AND (EQ s9 1) (EQ s13 1)) (AND (EQ s5 1) (EQ s10 1)) (AND (EQ s6 1) (EQ s11 1)) (AND (EQ s7 1) (EQ s12 1))), p0:(OR (AN...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 3 reset in 5 ms.
FORMULA Philosophers-PT-000005-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-04 finished in 441 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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
[2022-05-17 21:07:31] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-17 21:07:31] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:31] [INFO ] Computed 10 place invariants in 8 ms
[2022-05-17 21:07:31] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-05-17 21:07:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:31] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 21:07:31] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s8 1) (EQ s14 1)) (AND (EQ s9 1) (EQ s13 1)) (AND (EQ s5 1) (EQ s10 1)) (AND (EQ s6 1) (EQ s11 1)) (AND (EQ s7 1) (EQ s12 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000005-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-07 finished in 196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((p1&&F(p2))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 23 transition count 23
Applied a total of 4 rules in 11 ms. Remains 23 /25 variables (removed 2) and now considering 23/25 (removed 2) transitions.
// Phase 1: matrix 23 rows 23 cols
[2022-05-17 21:07:31] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 21:07:31] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2022-05-17 21:07:31] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 21:07:31] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2022-05-17 21:07:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2022-05-17 21:07:31] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 21:07:31] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/25 places, 23/25 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/25 places, 23/25 transitions.
Stuttering acceptance computed with spot in 67 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s21 1), p0:(EQ s22 1), p2:(AND (EQ s1 1) (EQ s6 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 33 steps with 2 reset in 0 ms.
FORMULA Philosophers-PT-000005-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-09 finished in 206 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(G(p0)))||F(p1)||p2)))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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
[2022-05-17 21:07:32] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 21:07:32] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:32] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 21:07:32] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2022-05-17 21:07:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:32] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 21:07:32] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s24 1), p1:(AND (EQ s6 1) (EQ s11 1)), p0:(AND (EQ s9 1) (EQ s13 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 20 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-10 finished in 229 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(((F(p0)&&p1)||G(G(p2))))&&F(p3)))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-17 21:07:32] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 21:07:32] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:32] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 21:07:32] [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
[2022-05-17 21:07:32] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 21:07:32] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p3), true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (EQ s5 1) (EQ s10 1)), p2:(OR (EQ s5 0) (EQ s10 0)), p1:(EQ s24 0), p0:(OR (EQ s3 0) (EQ s8 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000005-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-11 finished in 383 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0)))||G(F(p1))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-17 21:07:32] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 21:07:32] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:32] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 21:07:32] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:32] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 21:07:32] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ 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:(AND (EQ s8 1) (EQ s20 1)), p1:(OR (EQ s2 0) (EQ s6 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7478 reset in 186 ms.
Stack based approach found an accepted trace after 2363 steps with 162 reset with depth 9 and stack size 9 in 5 ms.
FORMULA Philosophers-PT-000005-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-12 finished in 548 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(((X(p1)||p2)&&p0))||F(p3)))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-17 21:07:33] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 21:07:33] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:33] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 21:07:33] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:33] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 21:07:33] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3)]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2 (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2 (NOT p3) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p3) p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p1))), acceptance={} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s6 1)), p2:(EQ s24 1), p3:(OR (EQ s0 0) (EQ s9 0)), p1:(AND (EQ s1 1) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 27768 reset in 149 ms.
Stack based approach found an accepted trace after 16 steps with 3 reset with depth 7 and stack size 7 in 0 ms.
FORMULA Philosophers-PT-000005-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-13 finished in 437 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((X(X(p0))||F(G(p1)))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-17 21:07:33] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 21:07:33] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:33] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 21:07:33] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 21:07:33] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 21:07:33] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (EQ s8 0) (EQ s14 0)), p0:(OR (EQ s6 0) (EQ s11 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19439 reset in 113 ms.
Stack based approach found an accepted trace after 2445 steps with 477 reset with depth 7 and stack size 7 in 8 ms.
FORMULA Philosophers-PT-000005-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-14 finished in 431 ms.
All properties solved by simple procedures.
Total runtime 5134 ms.

BK_STOP 1652821654178

--------------------
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="Philosophers-PT-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-PT-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 r168-tall-165277016500284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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