Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089267800069.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 Planning-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089267800069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K 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.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 09:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 09:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 11:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 11:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 56K May 5 16:51 model.pnml
-rw-r--r-- 1 mcc users 1 May 5 16:51 unfinite

--------------------
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 Planning-PT-none-00
FORMULA_NAME Planning-PT-none-01
FORMULA_NAME Planning-PT-none-02
FORMULA_NAME Planning-PT-none-03
FORMULA_NAME Planning-PT-none-04
FORMULA_NAME Planning-PT-none-05
FORMULA_NAME Planning-PT-none-06
FORMULA_NAME Planning-PT-none-07
FORMULA_NAME Planning-PT-none-08
FORMULA_NAME Planning-PT-none-09
FORMULA_NAME Planning-PT-none-10
FORMULA_NAME Planning-PT-none-11
FORMULA_NAME Planning-PT-none-12
FORMULA_NAME Planning-PT-none-13
FORMULA_NAME Planning-PT-none-14
FORMULA_NAME Planning-PT-none-15

=== Now, execution of the tool begins

BK_START 1621180171479

Running Version 0
[2021-05-16 15:49:33] [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-05-16 15:49:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 15:49:33] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2021-05-16 15:49:33] [INFO ] Transformed 126 places.
[2021-05-16 15:49:33] [INFO ] Transformed 128 transitions.
[2021-05-16 15:49:33] [INFO ] Parsed PT model containing 126 places and 128 transitions in 74 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 15:49:33] [INFO ] Initial state test concluded for 4 properties.
Reduce places removed 2 places and 0 transitions.
FORMULA Planning-PT-none-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 124 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 124/124 places, 128/128 transitions.
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 98 transition count 123
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 43 place count 86 transition count 111
Iterating global reduction 1 with 12 rules applied. Total rules applied 55 place count 86 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 85 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 85 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 85 transition count 108
Applied a total of 58 rules in 71 ms. Remains 85 /124 variables (removed 39) and now considering 108/128 (removed 20) transitions.
[2021-05-16 15:49:33] [INFO ] Flow matrix only has 80 transitions (discarded 28 similar events)
// Phase 1: matrix 80 rows 85 cols
[2021-05-16 15:49:33] [INFO ] Computed 37 place invariants in 13 ms
[2021-05-16 15:49:33] [INFO ] Implicit Places using invariants in 154 ms returned []
[2021-05-16 15:49:33] [INFO ] Flow matrix only has 80 transitions (discarded 28 similar events)
// Phase 1: matrix 80 rows 85 cols
[2021-05-16 15:49:33] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-16 15:49:33] [INFO ] State equation strengthened by 18 read => feed constraints.
[2021-05-16 15:49:33] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2021-05-16 15:49:33] [INFO ] Flow matrix only has 80 transitions (discarded 28 similar events)
// Phase 1: matrix 80 rows 85 cols
[2021-05-16 15:49:33] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-16 15:49:33] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/124 places, 108/128 transitions.
[2021-05-16 15:49:34] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-16 15:49:34] [INFO ] Flatten gal took : 35 ms
FORMULA Planning-PT-none-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 15:49:34] [INFO ] Flatten gal took : 10 ms
[2021-05-16 15:49:34] [INFO ] Input system was already deterministic with 108 transitions.
Finished random walk after 717 steps, including 0 resets, run visited all 21 properties in 25 ms. (steps per millisecond=28 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F((p1||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 108/108 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 82 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 82 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 82 transition count 103
Applied a total of 7 rules in 3 ms. Remains 82 /85 variables (removed 3) and now considering 103/108 (removed 5) transitions.
[2021-05-16 15:49:34] [INFO ] Flow matrix only has 76 transitions (discarded 27 similar events)
// Phase 1: matrix 76 rows 82 cols
[2021-05-16 15:49:34] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-16 15:49:34] [INFO ] Implicit Places using invariants in 89 ms returned []
[2021-05-16 15:49:34] [INFO ] Flow matrix only has 76 transitions (discarded 27 similar events)
// Phase 1: matrix 76 rows 82 cols
[2021-05-16 15:49:34] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-16 15:49:34] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-16 15:49:34] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2021-05-16 15:49:34] [INFO ] Flow matrix only has 76 transitions (discarded 27 similar events)
// Phase 1: matrix 76 rows 82 cols
[2021-05-16 15:49:34] [INFO ] Computed 37 place invariants in 0 ms
[2021-05-16 15:49:34] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Finished structural reductions, in 1 iterations. Remains : 82/85 places, 103/108 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Planning-PT-none-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s33 1) (GEQ s40 1)), p1:(AND (GEQ s11 1) (GEQ s39 1) (GEQ s78 1)), p2:(LT s71 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1299 reset in 460 ms.
Stack based approach found an accepted trace after 1142 steps with 19 reset with depth 74 and stack size 72 in 8 ms.
FORMULA Planning-PT-none-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-00 finished in 1056 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (G(p0)&&p1))))], workingDir=/home/mcc/execution]
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 108/108 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 81 transition count 103
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 81 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 81 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 80 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 80 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 80 transition count 99
Applied a total of 12 rules in 6 ms. Remains 80 /85 variables (removed 5) and now considering 99/108 (removed 9) transitions.
[2021-05-16 15:49:35] [INFO ] Flow matrix only has 73 transitions (discarded 26 similar events)
// Phase 1: matrix 73 rows 80 cols
[2021-05-16 15:49:35] [INFO ] Computed 37 place invariants in 5 ms
[2021-05-16 15:49:35] [INFO ] Implicit Places using invariants in 40 ms returned []
[2021-05-16 15:49:35] [INFO ] Flow matrix only has 73 transitions (discarded 26 similar events)
// Phase 1: matrix 73 rows 80 cols
[2021-05-16 15:49:35] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-16 15:49:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2021-05-16 15:49:35] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2021-05-16 15:49:35] [INFO ] Flow matrix only has 73 transitions (discarded 26 similar events)
// Phase 1: matrix 73 rows 80 cols
[2021-05-16 15:49:35] [INFO ] Computed 37 place invariants in 6 ms
[2021-05-16 15:49:35] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 1 iterations. Remains : 80/85 places, 99/108 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Planning-PT-none-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s14 1) (GEQ s42 1) (GEQ s57 1) (GEQ s70 1)), p1:(AND (GEQ s6 1) (GEQ s12 1) (GEQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Planning-PT-none-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-02 finished in 372 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 108/108 transitions.
Graph (trivial) has 29 edges and 85 vertex of which 24 / 85 are part of one of the 12 SCC in 2 ms
Free SCC test removed 12 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 61 transition count 85
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 57 transition count 80
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 57 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 57 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 55 transition count 61
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 55 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 27 place count 55 transition count 59
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 44 place count 44 transition count 53
Applied a total of 44 rules in 30 ms. Remains 44 /85 variables (removed 41) and now considering 53/108 (removed 55) transitions.
[2021-05-16 15:49:35] [INFO ] Flow matrix only has 43 transitions (discarded 10 similar events)
// Phase 1: matrix 43 rows 44 cols
[2021-05-16 15:49:35] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-16 15:49:35] [INFO ] Implicit Places using invariants in 28 ms returned []
[2021-05-16 15:49:35] [INFO ] Flow matrix only has 43 transitions (discarded 10 similar events)
// Phase 1: matrix 43 rows 44 cols
[2021-05-16 15:49:35] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-16 15:49:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2021-05-16 15:49:35] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2021-05-16 15:49:35] [INFO ] Redundant transitions in 30 ms returned []
[2021-05-16 15:49:35] [INFO ] Flow matrix only has 43 transitions (discarded 10 similar events)
// Phase 1: matrix 43 rows 44 cols
[2021-05-16 15:49:35] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-16 15:49:35] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 44/85 places, 53/108 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Planning-PT-none-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s6 1) (GEQ s17 1)), p1:(GEQ s16 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 40 steps with 0 reset in 1 ms.
FORMULA Planning-PT-none-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-03 finished in 253 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)||G(p2)))], workingDir=/home/mcc/execution]
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 108/108 transitions.
Graph (trivial) has 29 edges and 85 vertex of which 24 / 85 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 61 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 56 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 56 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 56 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 55 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 55 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 55 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 44 place count 44 transition count 67
Applied a total of 44 rules in 8 ms. Remains 44 /85 variables (removed 41) and now considering 67/108 (removed 41) transitions.
[2021-05-16 15:49:35] [INFO ] Flow matrix only has 43 transitions (discarded 24 similar events)
// Phase 1: matrix 43 rows 44 cols
[2021-05-16 15:49:35] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-16 15:49:35] [INFO ] Implicit Places using invariants in 53 ms returned []
[2021-05-16 15:49:35] [INFO ] Flow matrix only has 43 transitions (discarded 24 similar events)
// Phase 1: matrix 43 rows 44 cols
[2021-05-16 15:49:35] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-16 15:49:36] [INFO ] State equation strengthened by 16 read => feed constraints.
[2021-05-16 15:49:36] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2021-05-16 15:49:36] [INFO ] Redundant transitions in 24 ms returned []
[2021-05-16 15:49:36] [INFO ] Flow matrix only has 43 transitions (discarded 24 similar events)
// Phase 1: matrix 43 rows 44 cols
[2021-05-16 15:49:36] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-16 15:49:36] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 44/85 places, 67/108 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Planning-PT-none-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(GEQ s16 1), p0:(AND (GEQ s1 1) (GEQ s27 1)), p2:(AND (GEQ s14 1) (GEQ s19 1) (GEQ s20 1) (GEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Planning-PT-none-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-04 finished in 356 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 108/108 transitions.
Graph (trivial) has 31 edges and 85 vertex of which 26 / 85 are part of one of the 13 SCC in 1 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 59 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 54 transition count 76
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 54 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 54 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 52 transition count 56
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 52 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 52 transition count 54
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 48 place count 41 transition count 48
Applied a total of 48 rules in 23 ms. Remains 41 /85 variables (removed 44) and now considering 48/108 (removed 60) transitions.
[2021-05-16 15:49:36] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
// Phase 1: matrix 40 rows 41 cols
[2021-05-16 15:49:36] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-16 15:49:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2021-05-16 15:49:36] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
// Phase 1: matrix 40 rows 41 cols
[2021-05-16 15:49:36] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-16 15:49:36] [INFO ] State equation strengthened by 16 read => feed constraints.
[2021-05-16 15:49:36] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2021-05-16 15:49:36] [INFO ] Redundant transitions in 18 ms returned []
[2021-05-16 15:49:36] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
// Phase 1: matrix 40 rows 41 cols
[2021-05-16 15:49:36] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-16 15:49:36] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/85 places, 48/108 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Planning-PT-none-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s14 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 0 steps with 0 reset in 0 ms.
FORMULA Planning-PT-none-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-06 finished in 174 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X((G((X(X(X(p1)))||(F(p1)&&F(p2)))) U (p0&&G((X(X(X(p1)))||(F(p1)&&F(p2))))))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 108/108 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 80 transition count 101
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 80 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 80 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 79 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 79 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 79 transition count 96
Applied a total of 15 rules in 13 ms. Remains 79 /85 variables (removed 6) and now considering 96/108 (removed 12) transitions.
[2021-05-16 15:49:36] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 79 cols
[2021-05-16 15:49:36] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-16 15:49:36] [INFO ] Implicit Places using invariants in 30 ms returned []
[2021-05-16 15:49:36] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 79 cols
[2021-05-16 15:49:36] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-16 15:49:36] [INFO ] State equation strengthened by 16 read => feed constraints.
[2021-05-16 15:49:36] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2021-05-16 15:49:36] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 79 cols
[2021-05-16 15:49:36] [INFO ] Computed 37 place invariants in 0 ms
[2021-05-16 15:49:36] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/85 places, 96/108 transitions.
Stuttering acceptance computed with spot in 298 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Planning-PT-none-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s28 1), p2:(GEQ s20 1), p1:(AND (GEQ s45 1) (GEQ s55 1) (GEQ s66 1) (GEQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 877 reset in 300 ms.
Stack based approach found an accepted trace after 84 steps with 1 reset with depth 73 and stack size 72 in 1 ms.
FORMULA Planning-PT-none-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-07 finished in 770 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 108/108 transitions.
Graph (trivial) has 31 edges and 85 vertex of which 26 / 85 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 59 transition count 83
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 55 transition count 77
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 55 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 55 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 54 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 54 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 54 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 43 place count 43 transition count 66
Applied a total of 43 rules in 11 ms. Remains 43 /85 variables (removed 42) and now considering 66/108 (removed 42) transitions.
[2021-05-16 15:49:37] [INFO ] Flow matrix only has 43 transitions (discarded 23 similar events)
// Phase 1: matrix 43 rows 43 cols
[2021-05-16 15:49:37] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-16 15:49:37] [INFO ] Implicit Places using invariants in 29 ms returned []
[2021-05-16 15:49:37] [INFO ] Flow matrix only has 43 transitions (discarded 23 similar events)
// Phase 1: matrix 43 rows 43 cols
[2021-05-16 15:49:37] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-16 15:49:37] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-16 15:49:37] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2021-05-16 15:49:37] [INFO ] Redundant transitions in 37 ms returned []
[2021-05-16 15:49:37] [INFO ] Flow matrix only has 43 transitions (discarded 23 similar events)
// Phase 1: matrix 43 rows 43 cols
[2021-05-16 15:49:37] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-16 15:49:37] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 43/85 places, 66/108 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Planning-PT-none-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s15 1) (LT s2 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 7 steps with 0 reset in 1 ms.
FORMULA Planning-PT-none-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-10 finished in 214 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 108/108 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 80 transition count 101
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 80 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 80 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 79 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 79 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 79 transition count 96
Applied a total of 15 rules in 2 ms. Remains 79 /85 variables (removed 6) and now considering 96/108 (removed 12) transitions.
[2021-05-16 15:49:37] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 79 cols
[2021-05-16 15:49:37] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-16 15:49:37] [INFO ] Implicit Places using invariants in 52 ms returned []
[2021-05-16 15:49:37] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 79 cols
[2021-05-16 15:49:37] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-16 15:49:37] [INFO ] State equation strengthened by 16 read => feed constraints.
[2021-05-16 15:49:37] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2021-05-16 15:49:37] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 79 cols
[2021-05-16 15:49:37] [INFO ] Computed 37 place invariants in 0 ms
[2021-05-16 15:49:37] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/85 places, 96/108 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Planning-PT-none-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s21 1) (GEQ s38 1) (GEQ s55 1) (GEQ s73 1)) (AND (GEQ s1 1) (GEQ s57 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 9 steps with 0 reset in 0 ms.
FORMULA Planning-PT-none-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-11 finished in 257 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||G(p1)||X(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 108/108 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 82 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 82 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 82 transition count 103
Applied a total of 7 rules in 2 ms. Remains 82 /85 variables (removed 3) and now considering 103/108 (removed 5) transitions.
[2021-05-16 15:49:37] [INFO ] Flow matrix only has 76 transitions (discarded 27 similar events)
// Phase 1: matrix 76 rows 82 cols
[2021-05-16 15:49:37] [INFO ] Computed 37 place invariants in 0 ms
[2021-05-16 15:49:37] [INFO ] Implicit Places using invariants in 39 ms returned []
[2021-05-16 15:49:37] [INFO ] Flow matrix only has 76 transitions (discarded 27 similar events)
// Phase 1: matrix 76 rows 82 cols
[2021-05-16 15:49:37] [INFO ] Computed 37 place invariants in 0 ms
[2021-05-16 15:49:37] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-16 15:49:37] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2021-05-16 15:49:37] [INFO ] Flow matrix only has 76 transitions (discarded 27 similar events)
// Phase 1: matrix 76 rows 82 cols
[2021-05-16 15:49:37] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-16 15:49:37] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 82/85 places, 103/108 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : Planning-PT-none-13 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(GEQ s53 1), p1:(AND (GEQ s13 1) (GEQ s41 1) (GEQ s81 1)), p2:(GEQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 18 steps with 0 reset in 0 ms.
FORMULA Planning-PT-none-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-13 finished in 366 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(p1)&&p0))))], workingDir=/home/mcc/execution]
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 108/108 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 81 transition count 103
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 81 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 81 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 80 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 80 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 80 transition count 85
Applied a total of 12 rules in 4 ms. Remains 80 /85 variables (removed 5) and now considering 85/108 (removed 23) transitions.
[2021-05-16 15:49:38] [INFO ] Flow matrix only has 73 transitions (discarded 12 similar events)
// Phase 1: matrix 73 rows 80 cols
[2021-05-16 15:49:38] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-16 15:49:38] [INFO ] Implicit Places using invariants in 40 ms returned []
[2021-05-16 15:49:38] [INFO ] Flow matrix only has 73 transitions (discarded 12 similar events)
// Phase 1: matrix 73 rows 80 cols
[2021-05-16 15:49:38] [INFO ] Computed 37 place invariants in 0 ms
[2021-05-16 15:49:38] [INFO ] State equation strengthened by 16 read => feed constraints.
[2021-05-16 15:49:38] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2021-05-16 15:49:38] [INFO ] Flow matrix only has 73 transitions (discarded 12 similar events)
// Phase 1: matrix 73 rows 80 cols
[2021-05-16 15:49:38] [INFO ] Computed 37 place invariants in 0 ms
[2021-05-16 15:49:38] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 80/85 places, 85/108 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Planning-PT-none-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s22 1) (GEQ s39 1) (GEQ s76 1) (OR (LT s6 1) (LT s33 1) (LT s40 1))), p1:(OR (LT s22 1) (LT s39 1) (LT s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Planning-PT-none-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-15 finished in 341 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621180178655

--------------------
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="Planning-PT-none"
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 Planning-PT-none, 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 r159-oct2-162089267800069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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