Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r597-smll-171734926400058.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is MedleyA-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926400058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 43K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717362508321

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-12
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 21:08:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 21:08:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:08:31] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-06-02 21:08:31] [INFO ] Transformed 172 places.
[2024-06-02 21:08:31] [INFO ] Transformed 166 transitions.
[2024-06-02 21:08:31] [INFO ] Found NUPN structural information;
[2024-06-02 21:08:31] [INFO ] Parsed PT model containing 172 places and 166 transitions and 466 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MedleyA-PT-12-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-12-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-12-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-12-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 166/166 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 168 transition count 166
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 16 place count 156 transition count 154
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 156 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 155 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 155 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 154 transition count 152
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 154 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 153 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 153 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 152 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 152 transition count 150
Applied a total of 36 rules in 81 ms. Remains 152 /172 variables (removed 20) and now considering 150/166 (removed 16) transitions.
// Phase 1: matrix 150 rows 152 cols
[2024-06-02 21:08:31] [INFO ] Computed 20 invariants in 15 ms
[2024-06-02 21:08:31] [INFO ] Implicit Places using invariants in 310 ms returned [34, 40]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 355 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/172 places, 150/166 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 441 ms. Remains : 150/172 places, 150/166 transitions.
Support contains 34 out of 150 places after structural reductions.
[2024-06-02 21:08:32] [INFO ] Flatten gal took : 54 ms
[2024-06-02 21:08:32] [INFO ] Flatten gal took : 21 ms
[2024-06-02 21:08:32] [INFO ] Input system was already deterministic with 150 transitions.
Incomplete random walk after 10000 steps, including 201 resets, run finished after 599 ms. (steps per millisecond=16 ) properties (out of 24) seen :21
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 59 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 150 rows 150 cols
[2024-06-02 21:08:33] [INFO ] Computed 18 invariants in 5 ms
[2024-06-02 21:08:33] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-02 21:08:33] [INFO ] [Real]Absence check using 11 positive and 7 generalized place invariants in 5 ms returned sat
[2024-06-02 21:08:33] [INFO ] After 115ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-06-02 21:08:33] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 7 ms to minimize.
[2024-06-02 21:08:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2024-06-02 21:08:33] [INFO ] After 273ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:08:33] [INFO ] After 421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:08:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-02 21:08:33] [INFO ] [Nat]Absence check using 11 positive and 7 generalized place invariants in 4 ms returned sat
[2024-06-02 21:08:33] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 21:08:33] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2024-06-02 21:08:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2024-06-02 21:08:33] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-06-02 21:08:33] [INFO ] After 510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 149 transition count 124
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 123 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 122 transition count 122
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 56 place count 122 transition count 97
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 51 rules applied. Total rules applied 107 place count 96 transition count 97
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 109 place count 95 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 94 transition count 96
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 114 place count 90 transition count 92
Iterating global reduction 5 with 4 rules applied. Total rules applied 118 place count 90 transition count 92
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 170 place count 64 transition count 66
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 182 place count 58 transition count 77
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 58 transition count 76
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 190 place count 58 transition count 69
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 197 place count 51 transition count 69
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 200 place count 51 transition count 66
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 203 place count 48 transition count 66
Applied a total of 203 rules in 53 ms. Remains 48 /150 variables (removed 102) and now considering 66/150 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 48/150 places, 66/150 transitions.
Finished random walk after 5078 steps, including 542 resets, run visited all 2 properties in 39 ms. (steps per millisecond=130 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(F(p1))))))'
Support contains 5 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 145 transition count 146
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 145 transition count 146
Applied a total of 9 rules in 6 ms. Remains 145 /150 variables (removed 5) and now considering 146/150 (removed 4) transitions.
// Phase 1: matrix 146 rows 145 cols
[2024-06-02 21:08:34] [INFO ] Computed 17 invariants in 3 ms
[2024-06-02 21:08:34] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-02 21:08:34] [INFO ] Invariant cache hit.
[2024-06-02 21:08:34] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2024-06-02 21:08:34] [INFO ] Invariant cache hit.
[2024-06-02 21:08:35] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/150 places, 146/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 685 ms. Remains : 145/150 places, 146/150 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s113 1), p1:(AND (EQ s21 1) (EQ s30 1) (EQ s33 1) (EQ s39 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]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-12-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-02 finished in 1090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0||X(F(p1))))&&F(p2))))'
Support contains 5 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 141 transition count 131
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 141 transition count 131
Applied a total of 17 rules in 10 ms. Remains 141 /150 variables (removed 9) and now considering 131/150 (removed 19) transitions.
// Phase 1: matrix 131 rows 141 cols
[2024-06-02 21:08:35] [INFO ] Computed 17 invariants in 17 ms
[2024-06-02 21:08:35] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-02 21:08:35] [INFO ] Invariant cache hit.
[2024-06-02 21:08:36] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2024-06-02 21:08:36] [INFO ] Invariant cache hit.
[2024-06-02 21:08:36] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/150 places, 131/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 879 ms. Remains : 141/150 places, 131/150 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s27 1), p0:(AND (EQ s33 1) (EQ s89 1)), p1:(AND (EQ s92 1) (EQ s113 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]]
Stuttering criterion allowed to conclude after 48 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-03 finished in 1113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (G(!p0)||(!p0&&(p1 U (p2||G(p1)))))))))'
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 148 transition count 123
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 122 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 121 transition count 121
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 56 place count 121 transition count 97
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 105 place count 96 transition count 97
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 95 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 108 place count 94 transition count 96
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 112 place count 90 transition count 92
Iterating global reduction 5 with 4 rules applied. Total rules applied 116 place count 90 transition count 92
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 164 place count 66 transition count 68
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 176 place count 60 transition count 79
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 177 place count 60 transition count 78
Applied a total of 177 rules in 48 ms. Remains 60 /150 variables (removed 90) and now considering 78/150 (removed 72) transitions.
// Phase 1: matrix 78 rows 60 cols
[2024-06-02 21:08:36] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 21:08:36] [INFO ] Implicit Places using invariants in 63 ms returned [23, 31, 35, 38]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 64 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/150 places, 78/150 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 56 transition count 76
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 54 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 53 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 52 transition count 75
Applied a total of 8 rules in 8 ms. Remains 52 /56 variables (removed 4) and now considering 75/78 (removed 3) transitions.
// Phase 1: matrix 75 rows 52 cols
[2024-06-02 21:08:36] [INFO ] Computed 11 invariants in 0 ms
[2024-06-02 21:08:36] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-02 21:08:36] [INFO ] Invariant cache hit.
[2024-06-02 21:08:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:08:37] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/150 places, 75/150 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 459 ms. Remains : 52/150 places, 75/150 transitions.
Stuttering acceptance computed with spot in 302 ms :[p0, p0, (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s6 1) (EQ s10 1) (EQ s14 1) (EQ s16 1))) (NEQ s26 1)), p1:(NEQ s26 1), p0:(OR (EQ s37 1) (EQ s26 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 10193 reset in 478 ms.
Product exploration explored 100000 steps with 10169 reset in 351 ms.
Computed a total of 3 stabilizing places and 10 stable transitions
Graph (complete) has 139 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 3 stabilizing places and 10 stable transitions
Detected a total of 3/52 stabilizing places and 10/75 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 318 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[p0, p0, (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 868 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 141 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 21:08:38] [INFO ] Invariant cache hit.
[2024-06-02 21:08:39] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-02 21:08:39] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 21:08:39] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p1 p0 (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (F (AND (NOT p1) p0 (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (OR (AND (NOT p1) (NOT p2)) p0)), (F p0)]
Knowledge based reduction with 10 factoid took 682 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[p0, p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 122 ms :[p0, p0, (AND p0 (NOT p2))]
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 75/75 transitions.
Applied a total of 0 rules in 7 ms. Remains 52 /52 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2024-06-02 21:08:39] [INFO ] Invariant cache hit.
[2024-06-02 21:08:40] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 21:08:40] [INFO ] Invariant cache hit.
[2024-06-02 21:08:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:08:40] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-06-02 21:08:40] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 21:08:40] [INFO ] Invariant cache hit.
[2024-06-02 21:08:40] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 238 ms. Remains : 52/52 places, 75/75 transitions.
Computed a total of 3 stabilizing places and 10 stable transitions
Graph (complete) has 139 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 3 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[p0, p0, (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 872 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 145 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 21:08:40] [INFO ] Invariant cache hit.
[2024-06-02 21:08:40] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 21:08:40] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 21:08:40] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:08:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 21:08:40] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 21:08:40] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:08:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:08:40] [INFO ] After 9ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:08:40] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-06-02 21:08:40] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 75/75 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 52 transition count 69
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 46 transition count 69
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 46 transition count 66
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 19 place count 42 transition count 66
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 42 transition count 64
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 39 transition count 64
Applied a total of 24 rules in 13 ms. Remains 39 /52 variables (removed 13) and now considering 64/75 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 39/52 places, 64/75 transitions.
Finished random walk after 285 steps, including 24 resets, run visited all 1 properties in 1 ms. (steps per millisecond=285 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (AND (NOT p2) p0)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 4 factoid took 273 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[p0, p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 168 ms :[p0, p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[p0, p0, (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 10226 reset in 214 ms.
Product exploration explored 100000 steps with 10213 reset in 434 ms.
Built C files in :
/tmp/ltsmin750798112365328119
[2024-06-02 21:08:42] [INFO ] Computing symmetric may disable matrix : 75 transitions.
[2024-06-02 21:08:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:08:42] [INFO ] Computing symmetric may enable matrix : 75 transitions.
[2024-06-02 21:08:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:08:42] [INFO ] Computing Do-Not-Accords matrix : 75 transitions.
[2024-06-02 21:08:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:08:42] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin750798112365328119
Running compilation step : cd /tmp/ltsmin750798112365328119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 466 ms.
Running link step : cd /tmp/ltsmin750798112365328119;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin750798112365328119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14269262613521756596.hoa' '--buchi-type=spotba'
LTSmin run took 1408 ms.
FORMULA MedleyA-PT-12-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-12-LTLFireability-04 finished in 7501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||X(p2))))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 142 transition count 132
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 142 transition count 132
Applied a total of 15 rules in 13 ms. Remains 142 /150 variables (removed 8) and now considering 132/150 (removed 18) transitions.
// Phase 1: matrix 132 rows 142 cols
[2024-06-02 21:08:44] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 21:08:44] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-06-02 21:08:44] [INFO ] Invariant cache hit.
[2024-06-02 21:08:44] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2024-06-02 21:08:44] [INFO ] Invariant cache hit.
[2024-06-02 21:08:44] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 142/150 places, 132/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 826 ms. Remains : 142/150 places, 132/150 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 p2), acceptance={} source=1 dest: 0}, { cond=(OR (AND p1 (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s100 1), p0:(EQ s36 0), p2:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-05 finished in 956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 143 transition count 133
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 143 transition count 133
Applied a total of 13 rules in 10 ms. Remains 143 /150 variables (removed 7) and now considering 133/150 (removed 17) transitions.
// Phase 1: matrix 133 rows 143 cols
[2024-06-02 21:08:45] [INFO ] Computed 17 invariants in 9 ms
[2024-06-02 21:08:45] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-02 21:08:45] [INFO ] Invariant cache hit.
[2024-06-02 21:08:45] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-06-02 21:08:45] [INFO ] Invariant cache hit.
[2024-06-02 21:08:45] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 143/150 places, 133/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 475 ms. Remains : 143/150 places, 133/150 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s3 1), p1:(EQ s126 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-06 finished in 635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 142 transition count 132
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 142 transition count 132
Applied a total of 15 rules in 7 ms. Remains 142 /150 variables (removed 8) and now considering 132/150 (removed 18) transitions.
// Phase 1: matrix 132 rows 142 cols
[2024-06-02 21:08:45] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 21:08:45] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 21:08:45] [INFO ] Invariant cache hit.
[2024-06-02 21:08:46] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-06-02 21:08:46] [INFO ] Invariant cache hit.
[2024-06-02 21:08:46] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 142/150 places, 132/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 514 ms. Remains : 142/150 places, 132/150 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s120 1), p1:(EQ s103 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]]
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-07 finished in 656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((G(F(p1))||(!p2&&F(p1)))))))'
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 146 transition count 147
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 146 transition count 147
Applied a total of 7 rules in 4 ms. Remains 146 /150 variables (removed 4) and now considering 147/150 (removed 3) transitions.
// Phase 1: matrix 147 rows 146 cols
[2024-06-02 21:08:46] [INFO ] Computed 17 invariants in 1 ms
[2024-06-02 21:08:46] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 21:08:46] [INFO ] Invariant cache hit.
[2024-06-02 21:08:46] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-06-02 21:08:46] [INFO ] Invariant cache hit.
[2024-06-02 21:08:46] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/150 places, 147/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 146/150 places, 147/150 transitions.
Stuttering acceptance computed with spot in 455 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s121 0), p2:(AND (EQ s21 1) (EQ s30 1) (EQ s33 1) (EQ s40 1)), p1:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-09 finished in 898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(X(F(p1)))))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 142 transition count 131
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 142 transition count 131
Applied a total of 16 rules in 6 ms. Remains 142 /150 variables (removed 8) and now considering 131/150 (removed 19) transitions.
// Phase 1: matrix 131 rows 142 cols
[2024-06-02 21:08:47] [INFO ] Computed 18 invariants in 1 ms
[2024-06-02 21:08:47] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-02 21:08:47] [INFO ] Invariant cache hit.
[2024-06-02 21:08:47] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-06-02 21:08:47] [INFO ] Invariant cache hit.
[2024-06-02 21:08:47] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 142/150 places, 131/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 582 ms. Remains : 142/150 places, 131/150 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s12 0) (EQ s121 0)), p0:(EQ s108 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-10 finished in 749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 148 transition count 124
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 123 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 122 transition count 122
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 54 place count 122 transition count 95
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 109 place count 94 transition count 95
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 111 place count 93 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 112 place count 92 transition count 94
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 120 place count 84 transition count 75
Iterating global reduction 5 with 8 rules applied. Total rules applied 128 place count 84 transition count 75
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 128 place count 84 transition count 74
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 130 place count 83 transition count 74
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 182 place count 57 transition count 48
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 196 place count 50 transition count 69
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 50 transition count 68
Applied a total of 197 rules in 34 ms. Remains 50 /150 variables (removed 100) and now considering 68/150 (removed 82) transitions.
// Phase 1: matrix 68 rows 50 cols
[2024-06-02 21:08:48] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 21:08:48] [INFO ] Implicit Places using invariants in 95 ms returned [15, 22, 26, 29]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 106 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/150 places, 68/150 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 46 transition count 67
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 67
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 43 transition count 77
Applied a total of 6 rules in 10 ms. Remains 43 /46 variables (removed 3) and now considering 77/68 (removed -9) transitions.
// Phase 1: matrix 77 rows 43 cols
[2024-06-02 21:08:48] [INFO ] Computed 11 invariants in 3 ms
[2024-06-02 21:08:48] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 21:08:48] [INFO ] Invariant cache hit.
[2024-06-02 21:08:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:08:48] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/150 places, 77/150 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 329 ms. Remains : 43/150 places, 77/150 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s38 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 6 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-11 finished in 389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(G(p0))) U p0))))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 141 transition count 131
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 141 transition count 131
Applied a total of 17 rules in 3 ms. Remains 141 /150 variables (removed 9) and now considering 131/150 (removed 19) transitions.
// Phase 1: matrix 131 rows 141 cols
[2024-06-02 21:08:48] [INFO ] Computed 17 invariants in 1 ms
[2024-06-02 21:08:48] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 21:08:48] [INFO ] Invariant cache hit.
[2024-06-02 21:08:48] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-06-02 21:08:48] [INFO ] Invariant cache hit.
[2024-06-02 21:08:48] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/150 places, 131/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 491 ms. Remains : 141/150 places, 131/150 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (EQ s94 1) (EQ s105 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-12 finished in 667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 141 transition count 131
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 141 transition count 131
Applied a total of 17 rules in 3 ms. Remains 141 /150 variables (removed 9) and now considering 131/150 (removed 19) transitions.
[2024-06-02 21:08:49] [INFO ] Invariant cache hit.
[2024-06-02 21:08:49] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 21:08:49] [INFO ] Invariant cache hit.
[2024-06-02 21:08:49] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-06-02 21:08:49] [INFO ] Invariant cache hit.
[2024-06-02 21:08:49] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/150 places, 131/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 345 ms. Remains : 141/150 places, 131/150 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s70 1) (EQ s83 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-13 finished in 514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 148 transition count 123
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 122 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 121 transition count 121
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 56 place count 121 transition count 96
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 51 rules applied. Total rules applied 107 place count 95 transition count 96
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 109 place count 94 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 93 transition count 95
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 114 place count 89 transition count 91
Iterating global reduction 5 with 4 rules applied. Total rules applied 118 place count 89 transition count 91
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 168 place count 64 transition count 66
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 180 place count 58 transition count 77
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 181 place count 58 transition count 76
Applied a total of 181 rules in 21 ms. Remains 58 /150 variables (removed 92) and now considering 76/150 (removed 74) transitions.
// Phase 1: matrix 76 rows 58 cols
[2024-06-02 21:08:49] [INFO ] Computed 15 invariants in 0 ms
[2024-06-02 21:08:49] [INFO ] Implicit Places using invariants in 132 ms returned [21, 29, 33, 36]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 135 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/150 places, 76/150 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 54 transition count 74
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 52 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 51 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 50 transition count 73
Applied a total of 8 rules in 6 ms. Remains 50 /54 variables (removed 4) and now considering 73/76 (removed 3) transitions.
// Phase 1: matrix 73 rows 50 cols
[2024-06-02 21:08:49] [INFO ] Computed 11 invariants in 0 ms
[2024-06-02 21:08:49] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 21:08:49] [INFO ] Invariant cache hit.
[2024-06-02 21:08:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:08:49] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/150 places, 73/150 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 327 ms. Remains : 50/150 places, 73/150 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s32 1) (EQ s36 1)), p1:(AND (EQ s6 1) (EQ s10 1) (EQ s13 1) (EQ s15 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 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-15 finished in 442 ms.
All properties solved by simple procedures.
Total runtime 19108 ms.

BK_STOP 1717362531298

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="MedleyA-PT-12"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is MedleyA-PT-12, 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 r597-smll-171734926400058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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