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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 8.1K Apr 30 04:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 30 04:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 04:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 04:29 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.5K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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.6K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 56K May 10 09:34 model.pnml
-rw-r--r-- 1 mcc users 1 May 10 09:34 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-LTLFireability-00
FORMULA_NAME Planning-PT-none-LTLFireability-01
FORMULA_NAME Planning-PT-none-LTLFireability-02
FORMULA_NAME Planning-PT-none-LTLFireability-03
FORMULA_NAME Planning-PT-none-LTLFireability-04
FORMULA_NAME Planning-PT-none-LTLFireability-05
FORMULA_NAME Planning-PT-none-LTLFireability-06
FORMULA_NAME Planning-PT-none-LTLFireability-07
FORMULA_NAME Planning-PT-none-LTLFireability-08
FORMULA_NAME Planning-PT-none-LTLFireability-09
FORMULA_NAME Planning-PT-none-LTLFireability-10
FORMULA_NAME Planning-PT-none-LTLFireability-11
FORMULA_NAME Planning-PT-none-LTLFireability-12
FORMULA_NAME Planning-PT-none-LTLFireability-13
FORMULA_NAME Planning-PT-none-LTLFireability-14
FORMULA_NAME Planning-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652848122825

Running Version 202205111006
[2022-05-18 04:28:43] [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 04:28:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 04:28:44] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2022-05-18 04:28:44] [INFO ] Transformed 126 places.
[2022-05-18 04:28:44] [INFO ] Transformed 128 transitions.
[2022-05-18 04:28:44] [INFO ] Parsed PT model containing 126 places and 128 transitions in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA Planning-PT-none-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 41 place count 88 transition count 113
Iterating global reduction 1 with 10 rules applied. Total rules applied 51 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 87 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 87 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 87 transition count 110
Applied a total of 54 rules in 20 ms. Remains 87 /124 variables (removed 37) and now considering 110/128 (removed 18) transitions.
[2022-05-18 04:28:44] [INFO ] Flow matrix only has 84 transitions (discarded 26 similar events)
// Phase 1: matrix 84 rows 87 cols
[2022-05-18 04:28:44] [INFO ] Computed 37 place invariants in 8 ms
[2022-05-18 04:28:44] [INFO ] Implicit Places using invariants in 155 ms returned []
[2022-05-18 04:28:44] [INFO ] Flow matrix only has 84 transitions (discarded 26 similar events)
// Phase 1: matrix 84 rows 87 cols
[2022-05-18 04:28:44] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-18 04:28:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-18 04:28:44] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2022-05-18 04:28:44] [INFO ] Flow matrix only has 84 transitions (discarded 26 similar events)
// Phase 1: matrix 84 rows 87 cols
[2022-05-18 04:28:44] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-18 04:28:44] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/124 places, 110/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/124 places, 110/128 transitions.
Support contains 43 out of 87 places after structural reductions.
[2022-05-18 04:28:44] [INFO ] Flatten gal took : 31 ms
[2022-05-18 04:28:44] [INFO ] Flatten gal took : 15 ms
[2022-05-18 04:28:44] [INFO ] Input system was already deterministic with 110 transitions.
Finished random walk after 1116 steps, including 0 resets, run visited all 29 properties in 82 ms. (steps per millisecond=13 )
FORMULA Planning-PT-none-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 438 edges and 87 vertex of which 81 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((p0 U p1)||G(p2)||p3)))))'
Support contains 9 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 110/110 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 83 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 83 transition count 106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 81 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 81 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 81 transition count 100
Applied a total of 14 rules in 12 ms. Remains 81 /87 variables (removed 6) and now considering 100/110 (removed 10) transitions.
[2022-05-18 04:28:45] [INFO ] Flow matrix only has 75 transitions (discarded 25 similar events)
// Phase 1: matrix 75 rows 81 cols
[2022-05-18 04:28:45] [INFO ] Computed 37 place invariants in 7 ms
[2022-05-18 04:28:45] [INFO ] Implicit Places using invariants in 67 ms returned []
[2022-05-18 04:28:45] [INFO ] Flow matrix only has 75 transitions (discarded 25 similar events)
// Phase 1: matrix 75 rows 81 cols
[2022-05-18 04:28:45] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-18 04:28:45] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-18 04:28:45] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2022-05-18 04:28:45] [INFO ] Flow matrix only has 75 transitions (discarded 25 similar events)
// Phase 1: matrix 75 rows 81 cols
[2022-05-18 04:28:45] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-18 04:28:45] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/87 places, 100/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/87 places, 100/110 transitions.
Stuttering acceptance computed with spot in 504 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : Planning-PT-none-LTLFireability-00 automaton TGBA Formula[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}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p0 p2), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 5}]], initial=6, aps=[p1:(AND (GEQ s45 1) (GEQ s57 1) (GEQ s68 1) (GEQ s73 1)), p0:(GEQ s3 1), p2:(AND (GEQ s11 1) (GEQ s39 1) (GEQ s78 1)), p3:(LT s26 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 3 ms.
FORMULA Planning-PT-none-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLFireability-00 finished in 825 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G(p0))))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 110/110 transitions.
Graph (trivial) has 33 edges and 87 vertex of which 28 / 87 are part of one of the 14 SCC in 2 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 416 edges and 73 vertex of which 67 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 53 transition count 77
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 49 transition count 55
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 49 transition count 55
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 27 place count 49 transition count 51
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 42 place count 39 transition count 46
Applied a total of 42 rules in 16 ms. Remains 39 /87 variables (removed 48) and now considering 46/110 (removed 64) transitions.
[2022-05-18 04:28:46] [INFO ] Flow matrix only has 38 transitions (discarded 8 similar events)
// Phase 1: matrix 38 rows 39 cols
[2022-05-18 04:28:46] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-18 04:28:46] [INFO ] Implicit Places using invariants in 49 ms returned []
[2022-05-18 04:28:46] [INFO ] Flow matrix only has 38 transitions (discarded 8 similar events)
// Phase 1: matrix 38 rows 39 cols
[2022-05-18 04:28:46] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-18 04:28:46] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-18 04:28:46] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2022-05-18 04:28:46] [INFO ] Redundant transitions in 39 ms returned []
[2022-05-18 04:28:46] [INFO ] Flow matrix only has 38 transitions (discarded 8 similar events)
// Phase 1: matrix 38 rows 39 cols
[2022-05-18 04:28:46] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-18 04:28:46] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/87 places, 46/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/87 places, 46/110 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0)]
Running random walk in product with property : Planning-PT-none-LTLFireability-03 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 (LT s0 1) (LT s29 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 18 steps with 0 reset in 1 ms.
FORMULA Planning-PT-none-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLFireability-03 finished in 349 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((G(G(F(p0)))||X(G(p1))||p2)))))'
Support contains 5 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 110/110 transitions.
Graph (trivial) has 29 edges and 87 vertex of which 24 / 87 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.
Graph (complete) has 419 edges and 75 vertex of which 70 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 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 13 place count 58 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 57 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 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 16 place count 57 transition count 79
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 31 place count 47 transition count 74
Applied a total of 31 rules in 14 ms. Remains 47 /87 variables (removed 40) and now considering 74/110 (removed 36) transitions.
[2022-05-18 04:28:46] [INFO ] Flow matrix only has 47 transitions (discarded 27 similar events)
// Phase 1: matrix 47 rows 47 cols
[2022-05-18 04:28:46] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-18 04:28:46] [INFO ] Implicit Places using invariants in 40 ms returned []
[2022-05-18 04:28:46] [INFO ] Flow matrix only has 47 transitions (discarded 27 similar events)
// Phase 1: matrix 47 rows 47 cols
[2022-05-18 04:28:46] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-18 04:28:46] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-18 04:28:46] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2022-05-18 04:28:46] [INFO ] Redundant transitions in 48 ms returned []
[2022-05-18 04:28:46] [INFO ] Flow matrix only has 47 transitions (discarded 27 similar events)
// Phase 1: matrix 47 rows 47 cols
[2022-05-18 04:28:46] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-18 04:28:46] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/87 places, 74/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/87 places, 74/110 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Planning-PT-none-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s17 1) (GEQ s43 1)), p1:(LT s46 1), p2:(LT 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 264 steps with 0 reset in 9 ms.
FORMULA Planning-PT-none-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLFireability-04 finished in 384 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(X(p1)))&&F((G(p3)&&p2))))'
Support contains 8 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 110/110 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 81 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 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 13 place count 81 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 79 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 79 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 79 transition count 96
Applied a total of 19 rules in 11 ms. Remains 79 /87 variables (removed 8) and now considering 96/110 (removed 14) transitions.
[2022-05-18 04:28:46] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 79 cols
[2022-05-18 04:28:46] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-18 04:28:47] [INFO ] Implicit Places using invariants in 54 ms returned []
[2022-05-18 04:28:47] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 79 cols
[2022-05-18 04:28:47] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-18 04:28:47] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-18 04:28:47] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2022-05-18 04:28:47] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 79 cols
[2022-05-18 04:28:47] [INFO ] Computed 37 place invariants in 0 ms
[2022-05-18 04:28:47] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/87 places, 96/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/87 places, 96/110 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (NOT p1), (NOT p1), (NOT p3), true]
Running random walk in product with property : Planning-PT-none-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p2 p3), acceptance={} source=0 dest: 4}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p3), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s11 1) (GEQ s39 1) (GEQ s56 1) (GEQ s71 1)), p3:(AND (GEQ s21 1) (GEQ s38 1) (GEQ s56 1) (GEQ s73 1)), p0:(GEQ s28 1), p1:(OR (AND (GEQ s11 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 510 ms.
Stack based approach found an accepted trace after 66 steps with 0 reset with depth 67 and stack size 67 in 1 ms.
FORMULA Planning-PT-none-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Planning-PT-none-LTLFireability-05 finished in 973 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X(G(F(X(p0))))))))'
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 110/110 transitions.
Graph (trivial) has 31 edges and 87 vertex of which 26 / 87 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.
Graph (complete) has 418 edges and 74 vertex of which 68 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 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 14 place count 55 transition count 79
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 51 transition count 57
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 51 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 26 place count 51 transition count 53
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 41 place count 41 transition count 48
Applied a total of 41 rules in 8 ms. Remains 41 /87 variables (removed 46) and now considering 48/110 (removed 62) transitions.
[2022-05-18 04:28:47] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
// Phase 1: matrix 40 rows 41 cols
[2022-05-18 04:28:47] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-18 04:28:47] [INFO ] Implicit Places using invariants in 43 ms returned []
[2022-05-18 04:28:47] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
// Phase 1: matrix 40 rows 41 cols
[2022-05-18 04:28:47] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 04:28:48] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-18 04:28:48] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2022-05-18 04:28:48] [INFO ] Redundant transitions in 30 ms returned []
[2022-05-18 04:28:48] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
// Phase 1: matrix 40 rows 41 cols
[2022-05-18 04:28:48] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 04:28:48] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/87 places, 48/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/87 places, 48/110 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Planning-PT-none-LTLFireability-06 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:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA Planning-PT-none-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLFireability-06 finished in 272 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 110/110 transitions.
Graph (trivial) has 29 edges and 87 vertex of which 24 / 87 are part of one of the 12 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 419 edges and 75 vertex of which 69 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 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 13 place count 57 transition count 81
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 53 transition count 59
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 53 transition count 59
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 53 transition count 55
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 40 place count 43 transition count 50
Applied a total of 40 rules in 14 ms. Remains 43 /87 variables (removed 44) and now considering 50/110 (removed 60) transitions.
[2022-05-18 04:28:48] [INFO ] Flow matrix only has 42 transitions (discarded 8 similar events)
// Phase 1: matrix 42 rows 43 cols
[2022-05-18 04:28:48] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-18 04:28:48] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-05-18 04:28:48] [INFO ] Flow matrix only has 42 transitions (discarded 8 similar events)
// Phase 1: matrix 42 rows 43 cols
[2022-05-18 04:28:48] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-18 04:28:48] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-18 04:28:48] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2022-05-18 04:28:48] [INFO ] Redundant transitions in 29 ms returned []
[2022-05-18 04:28:48] [INFO ] Flow matrix only has 42 transitions (discarded 8 similar events)
// Phase 1: matrix 42 rows 43 cols
[2022-05-18 04:28:48] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-18 04:28:48] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/87 places, 50/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/87 places, 50/110 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Planning-PT-none-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LT s16 1), p0:(LT s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA Planning-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLFireability-07 finished in 342 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(!(F(X(p0)) U p1))))'
Support contains 4 out of 87 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 110/110 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 81 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 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 13 place count 81 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 79 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 79 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 79 transition count 96
Applied a total of 19 rules in 12 ms. Remains 79 /87 variables (removed 8) and now considering 96/110 (removed 14) transitions.
[2022-05-18 04:28:48] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 79 cols
[2022-05-18 04:28:48] [INFO ] Computed 37 place invariants in 0 ms
[2022-05-18 04:28:48] [INFO ] Implicit Places using invariants in 42 ms returned []
[2022-05-18 04:28:48] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 79 cols
[2022-05-18 04:28:48] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-18 04:28:48] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-18 04:28:48] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-05-18 04:28:48] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 79 cols
[2022-05-18 04:28:48] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-18 04:28:48] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/87 places, 96/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/87 places, 96/110 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, p1, p1]
Running random walk in product with property : Planning-PT-none-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s32 1) (GEQ s39 1) (GEQ s55 1) (GEQ s71 1))], 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 481 steps with 0 reset in 11 ms.
FORMULA Planning-PT-none-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLFireability-08 finished in 325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(X(p0))||X(p1)))))'
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 110/110 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 82 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 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 11 place count 82 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 80 transition count 99
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 80 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 80 transition count 97
Applied a total of 17 rules in 6 ms. Remains 80 /87 variables (removed 7) and now considering 97/110 (removed 13) transitions.
[2022-05-18 04:28:48] [INFO ] Flow matrix only has 74 transitions (discarded 23 similar events)
// Phase 1: matrix 74 rows 80 cols
[2022-05-18 04:28:48] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-18 04:28:48] [INFO ] Implicit Places using invariants in 115 ms returned []
[2022-05-18 04:28:48] [INFO ] Flow matrix only has 74 transitions (discarded 23 similar events)
// Phase 1: matrix 74 rows 80 cols
[2022-05-18 04:28:48] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-18 04:28:49] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-18 04:28:49] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2022-05-18 04:28:49] [INFO ] Flow matrix only has 74 transitions (discarded 23 similar events)
// Phase 1: matrix 74 rows 80 cols
[2022-05-18 04:28:49] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-18 04:28:49] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/87 places, 97/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/87 places, 97/110 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Planning-PT-none-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s30 1) (GEQ s3 1)), p0:(AND (LT s35 1) (LT s31 1))], 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]]
Product exploration explored 100000 steps with 1969 reset in 329 ms.
Stack based approach found an accepted trace after 90 steps with 1 reset with depth 21 and stack size 21 in 1 ms.
FORMULA Planning-PT-none-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Planning-PT-none-LTLFireability-11 finished in 799 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((!F(p0) U !p0))||p1)))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 110/110 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 82 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 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 11 place count 82 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 80 transition count 99
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 80 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 80 transition count 97
Applied a total of 17 rules in 5 ms. Remains 80 /87 variables (removed 7) and now considering 97/110 (removed 13) transitions.
[2022-05-18 04:28:49] [INFO ] Flow matrix only has 74 transitions (discarded 23 similar events)
// Phase 1: matrix 74 rows 80 cols
[2022-05-18 04:28:49] [INFO ] Computed 37 place invariants in 5 ms
[2022-05-18 04:28:49] [INFO ] Implicit Places using invariants in 51 ms returned []
[2022-05-18 04:28:49] [INFO ] Flow matrix only has 74 transitions (discarded 23 similar events)
// Phase 1: matrix 74 rows 80 cols
[2022-05-18 04:28:49] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-18 04:28:49] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-18 04:28:49] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2022-05-18 04:28:49] [INFO ] Flow matrix only has 74 transitions (discarded 23 similar events)
// Phase 1: matrix 74 rows 80 cols
[2022-05-18 04:28:49] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-18 04:28:49] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/87 places, 97/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/87 places, 97/110 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Running random walk in product with property : Planning-PT-none-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(LT s79 1), p1:(LT s51 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, null][false, false, false]]
Product exploration explored 100000 steps with 193 reset in 311 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 0 ms.
FORMULA Planning-PT-none-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Planning-PT-none-LTLFireability-12 finished in 623 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(p0)||F(p0)) U (F(p1)&&p2)))'
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 110/110 transitions.
Graph (trivial) has 30 edges and 87 vertex of which 26 / 87 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.
Graph (complete) has 418 edges and 74 vertex of which 69 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 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 14 place count 56 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 54 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 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 20 place count 54 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 32 place count 46 transition count 70
Applied a total of 32 rules in 14 ms. Remains 46 /87 variables (removed 41) and now considering 70/110 (removed 40) transitions.
[2022-05-18 04:28:50] [INFO ] Flow matrix only has 45 transitions (discarded 25 similar events)
// Phase 1: matrix 45 rows 46 cols
[2022-05-18 04:28:50] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-18 04:28:50] [INFO ] Implicit Places using invariants in 39 ms returned []
[2022-05-18 04:28:50] [INFO ] Flow matrix only has 45 transitions (discarded 25 similar events)
// Phase 1: matrix 45 rows 46 cols
[2022-05-18 04:28:50] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-18 04:28:50] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-18 04:28:50] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2022-05-18 04:28:50] [INFO ] Redundant transitions in 16 ms returned []
[2022-05-18 04:28:50] [INFO ] Flow matrix only has 45 transitions (discarded 25 similar events)
// Phase 1: matrix 45 rows 46 cols
[2022-05-18 04:28:50] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-18 04:28:50] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/87 places, 70/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/87 places, 70/110 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p2) (NOT p1)), true, p0, (NOT p1)]
Running random walk in product with property : Planning-PT-none-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s17 1), p0:(GEQ s2 1), p1:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLFireability-13 finished in 319 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((X(p1)||p0)))&&F((X(p2)||p1))))'
Support contains 5 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 110/110 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 81 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 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 13 place count 81 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 79 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 79 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 79 transition count 96
Applied a total of 19 rules in 9 ms. Remains 79 /87 variables (removed 8) and now considering 96/110 (removed 14) transitions.
[2022-05-18 04:28:50] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 79 cols
[2022-05-18 04:28:50] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-18 04:28:50] [INFO ] Implicit Places using invariants in 42 ms returned []
[2022-05-18 04:28:50] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 79 cols
[2022-05-18 04:28:50] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-18 04:28:50] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-18 04:28:50] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2022-05-18 04:28:50] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 79 cols
[2022-05-18 04:28:50] [INFO ] Computed 37 place invariants in 0 ms
[2022-05-18 04:28:50] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/87 places, 96/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/87 places, 96/110 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Planning-PT-none-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0} source=2 dest: 3}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(GEQ s53 1), p2:(AND (GEQ s12 1) (GEQ s40 1) (GEQ s55 1) (GEQ s70 1)), p0:(OR (LT s12 1) (LT s40 1) (LT s55 1) (LT s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 91 steps with 0 reset in 1 ms.
FORMULA Planning-PT-none-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLFireability-14 finished in 353 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(F(X(p0))) U G(p0)))'
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 110/110 transitions.
Graph (trivial) has 31 edges and 87 vertex of which 26 / 87 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.
Graph (complete) has 417 edges and 74 vertex of which 68 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 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 14 place count 55 transition count 79
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 51 transition count 57
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 51 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 26 place count 51 transition count 53
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 41 place count 41 transition count 48
Applied a total of 41 rules in 11 ms. Remains 41 /87 variables (removed 46) and now considering 48/110 (removed 62) transitions.
[2022-05-18 04:28:50] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
// Phase 1: matrix 40 rows 41 cols
[2022-05-18 04:28:50] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-18 04:28:51] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-05-18 04:28:51] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
// Phase 1: matrix 40 rows 41 cols
[2022-05-18 04:28:51] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 04:28:51] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-18 04:28:51] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2022-05-18 04:28:51] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-18 04:28:51] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
// Phase 1: matrix 40 rows 41 cols
[2022-05-18 04:28:51] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-18 04:28:51] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/87 places, 48/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/87 places, 48/110 transitions.
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Running random walk in product with property : Planning-PT-none-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA Planning-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLFireability-15 finished in 220 ms.
All properties solved by simple procedures.
Total runtime 7188 ms.

BK_STOP 1652848131242

--------------------
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="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 r168-tall-165277016700436"
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 ;