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-171734926300008.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-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926300008
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 48K 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-02-LTLFireability-00
FORMULA_NAME MedleyA-PT-02-LTLFireability-01
FORMULA_NAME MedleyA-PT-02-LTLFireability-02
FORMULA_NAME MedleyA-PT-02-LTLFireability-03
FORMULA_NAME MedleyA-PT-02-LTLFireability-04
FORMULA_NAME MedleyA-PT-02-LTLFireability-05
FORMULA_NAME MedleyA-PT-02-LTLFireability-06
FORMULA_NAME MedleyA-PT-02-LTLFireability-07
FORMULA_NAME MedleyA-PT-02-LTLFireability-08
FORMULA_NAME MedleyA-PT-02-LTLFireability-09
FORMULA_NAME MedleyA-PT-02-LTLFireability-10
FORMULA_NAME MedleyA-PT-02-LTLFireability-11
FORMULA_NAME MedleyA-PT-02-LTLFireability-12
FORMULA_NAME MedleyA-PT-02-LTLFireability-13
FORMULA_NAME MedleyA-PT-02-LTLFireability-14
FORMULA_NAME MedleyA-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717361471553

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-02
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 20:51:14] [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 20:51:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:51:14] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-06-02 20:51:14] [INFO ] Transformed 69 places.
[2024-06-02 20:51:14] [INFO ] Transformed 168 transitions.
[2024-06-02 20:51:14] [INFO ] Found NUPN structural information;
[2024-06-02 20:51:14] [INFO ] Parsed PT model containing 69 places and 168 transitions and 765 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
FORMULA MedleyA-PT-02-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 57 transition count 146
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 57 transition count 146
Applied a total of 24 rules in 24 ms. Remains 57 /69 variables (removed 12) and now considering 146/162 (removed 16) transitions.
// Phase 1: matrix 146 rows 57 cols
[2024-06-02 20:51:14] [INFO ] Computed 9 invariants in 8 ms
[2024-06-02 20:51:15] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-06-02 20:51:15] [INFO ] Invariant cache hit.
[2024-06-02 20:51:15] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 20:51:15] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2024-06-02 20:51:15] [INFO ] Invariant cache hit.
[2024-06-02 20:51:15] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/69 places, 146/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 722 ms. Remains : 57/69 places, 146/162 transitions.
Support contains 28 out of 57 places after structural reductions.
[2024-06-02 20:51:15] [INFO ] Flatten gal took : 59 ms
[2024-06-02 20:51:15] [INFO ] Flatten gal took : 26 ms
[2024-06-02 20:51:15] [INFO ] Input system was already deterministic with 146 transitions.
Support contains 25 out of 57 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 985 resets, run finished after 892 ms. (steps per millisecond=11 ) properties (out of 20) seen :11
Incomplete Best-First random walk after 10001 steps, including 226 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 233 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 240 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 231 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 229 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 198 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 218 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 222 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 220 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-06-02 20:51:17] [INFO ] Invariant cache hit.
[2024-06-02 20:51:17] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:51:17] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 8 ms returned sat
[2024-06-02 20:51:17] [INFO ] After 158ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:7
[2024-06-02 20:51:17] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 20:51:18] [INFO ] After 22ms SMT Verify possible using 60 Read/Feed constraints in real domain returned unsat :1 sat :0 real:8
[2024-06-02 20:51:18] [INFO ] After 319ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2024-06-02 20:51:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:51:18] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 20:51:18] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2024-06-02 20:51:18] [INFO ] After 119ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2024-06-02 20:51:18] [INFO ] After 291ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 139 ms.
[2024-06-02 20:51:18] [INFO ] After 704ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 41 ms.
Support contains 13 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 146/146 transitions.
Graph (complete) has 254 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 53 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 53 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 52 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 9 place count 51 transition count 150
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 13 place count 51 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 13 place count 51 transition count 145
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 15 place count 50 transition count 145
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 25 place count 50 transition count 145
Applied a total of 25 rules in 51 ms. Remains 50 /57 variables (removed 7) and now considering 145/146 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 50/57 places, 145/146 transitions.
Incomplete random walk after 10000 steps, including 1189 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 305 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 294 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 279 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 292 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 295 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 227 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 246 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 145 rows 50 cols
[2024-06-02 20:51:19] [INFO ] Computed 9 invariants in 3 ms
[2024-06-02 20:51:19] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:51:19] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 20:51:19] [INFO ] After 125ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2024-06-02 20:51:19] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-02 20:51:19] [INFO ] After 27ms SMT Verify possible using 66 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 20:51:19] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 20:51:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 20:51:19] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 20:51:19] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-02 20:51:20] [INFO ] After 110ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-06-02 20:51:20] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 99 ms.
[2024-06-02 20:51:20] [INFO ] After 513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 19 ms.
Support contains 12 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 145/145 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 49 transition count 144
Applied a total of 2 rules in 11 ms. Remains 49 /50 variables (removed 1) and now considering 144/145 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 49/50 places, 144/145 transitions.
Incomplete random walk after 10000 steps, including 1190 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 298 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 281 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 300 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 297 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 240 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 251 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Finished probabilistic random walk after 119445 steps, run visited all 6 properties in 665 ms. (steps per millisecond=179 )
Probabilistic random walk after 119445 steps, saw 27734 distinct states, run finished after 665 ms. (steps per millisecond=179 ) properties seen :6
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 10 stabilizing places and 57 stable transitions
Graph (complete) has 319 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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)))'
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 146/146 transitions.
Graph (complete) has 319 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 49 transition count 129
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 49 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 13 place count 47 transition count 119
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 47 transition count 119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 17 place count 45 transition count 111
Iterating global reduction 0 with 2 rules applied. Total rules applied 19 place count 45 transition count 111
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 23 place count 43 transition count 109
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 33 place count 38 transition count 122
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 57 place count 38 transition count 98
Applied a total of 57 rules in 32 ms. Remains 38 /57 variables (removed 19) and now considering 98/146 (removed 48) transitions.
// Phase 1: matrix 98 rows 38 cols
[2024-06-02 20:51:21] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 20:51:21] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 20:51:21] [INFO ] Invariant cache hit.
[2024-06-02 20:51:22] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-02 20:51:22] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-06-02 20:51:22] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 20:51:22] [INFO ] Invariant cache hit.
[2024-06-02 20:51:22] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/57 places, 98/146 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 287 ms. Remains : 38/57 places, 98/146 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 258 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-01 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:(EQ s12 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 4 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-01 finished in 630 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((X((p0||G(p1)))&&G(p2))))'
Support contains 7 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 146/146 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 52 transition count 133
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 52 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 51 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 51 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 50 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 50 transition count 124
Applied a total of 14 rules in 13 ms. Remains 50 /57 variables (removed 7) and now considering 124/146 (removed 22) transitions.
// Phase 1: matrix 124 rows 50 cols
[2024-06-02 20:51:22] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 20:51:22] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 20:51:22] [INFO ] Invariant cache hit.
[2024-06-02 20:51:22] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-02 20:51:22] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-06-02 20:51:22] [INFO ] Invariant cache hit.
[2024-06-02 20:51:22] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/57 places, 124/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 50/57 places, 124/146 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0, 1} source=0 dest: 0}, { cond=p2, acceptance={0, 1} source=0 dest: 1}, { cond=p2, acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0, 1} source=2 dest: 0}, { cond=p2, acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (NEQ s23 1) (NEQ s29 1) (NEQ s36 1)), p0:(AND (EQ s3 1) (EQ s19 1) (EQ s23 1) (EQ s27 1)), p1:(EQ s16 1)], nbAcceptance=2, 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 1581 steps with 156 reset in 38 ms.
FORMULA MedleyA-PT-02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-03 finished in 655 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(p0)||X(G(p1))))'
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 146/146 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 50 transition count 125
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 50 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 49 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 49 transition count 120
Applied a total of 16 rules in 6 ms. Remains 49 /57 variables (removed 8) and now considering 120/146 (removed 26) transitions.
// Phase 1: matrix 120 rows 49 cols
[2024-06-02 20:51:23] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 20:51:23] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 20:51:23] [INFO ] Invariant cache hit.
[2024-06-02 20:51:23] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-02 20:51:23] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-06-02 20:51:23] [INFO ] Invariant cache hit.
[2024-06-02 20:51:23] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/57 places, 120/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 302 ms. Remains : 49/57 places, 120/146 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s3 1) (EQ s9 1) (EQ s16 1)), p1:(EQ s34 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 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-05 finished in 511 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(p0))'
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 146/146 transitions.
Graph (complete) has 319 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 49 transition count 125
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 49 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 48 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 48 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 47 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 47 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 19 place count 45 transition count 114
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 27 place count 41 transition count 123
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 0 with 19 rules applied. Total rules applied 46 place count 41 transition count 104
Applied a total of 46 rules in 30 ms. Remains 41 /57 variables (removed 16) and now considering 104/146 (removed 42) transitions.
// Phase 1: matrix 104 rows 41 cols
[2024-06-02 20:51:23] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 20:51:23] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 20:51:23] [INFO ] Invariant cache hit.
[2024-06-02 20:51:23] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-02 20:51:23] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-06-02 20:51:23] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 20:51:23] [INFO ] Invariant cache hit.
[2024-06-02 20:51:23] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/57 places, 104/146 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 285 ms. Remains : 41/57 places, 104/146 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s19 1) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-02-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-06 finished in 344 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(p0))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 146/146 transitions.
Graph (complete) has 319 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 49 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 49 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 15 place count 47 transition count 114
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 47 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 19 place count 45 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 21 place count 45 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 25 place count 43 transition count 104
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 37 place count 37 transition count 139
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 0 with 30 rules applied. Total rules applied 67 place count 37 transition count 109
Applied a total of 67 rules in 28 ms. Remains 37 /57 variables (removed 20) and now considering 109/146 (removed 37) transitions.
// Phase 1: matrix 109 rows 37 cols
[2024-06-02 20:51:23] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:51:24] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-02 20:51:24] [INFO ] Invariant cache hit.
[2024-06-02 20:51:24] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 20:51:24] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-06-02 20:51:24] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 20:51:24] [INFO ] Invariant cache hit.
[2024-06-02 20:51:24] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/57 places, 109/146 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 280 ms. Remains : 37/57 places, 109/146 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s27 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-07 finished in 346 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&&F(G(p2))))))'
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 146/146 transitions.
Graph (complete) has 319 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 50 transition count 125
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 50 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 15 place count 48 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 48 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 47 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 47 transition count 111
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 44 transition count 108
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 35 place count 39 transition count 139
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 60 place count 39 transition count 114
Applied a total of 60 rules in 26 ms. Remains 39 /57 variables (removed 18) and now considering 114/146 (removed 32) transitions.
// Phase 1: matrix 114 rows 39 cols
[2024-06-02 20:51:24] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:51:24] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-02 20:51:24] [INFO ] Invariant cache hit.
[2024-06-02 20:51:24] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 20:51:24] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-06-02 20:51:24] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 20:51:24] [INFO ] Invariant cache hit.
[2024-06-02 20:51:24] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/57 places, 114/146 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 283 ms. Remains : 39/57 places, 114/146 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s6 1), p0:(AND (EQ s30 1) (EQ s17 1) (EQ s25 1)), p2:(OR (EQ s17 0) (EQ s25 0))], nbAcceptance=2, 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 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-09 finished in 441 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(((p0 U X(X(p0))) U (X(p1)||G(p2))))))'
Support contains 7 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 146/146 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 52 transition count 133
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 52 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 51 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 51 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 50 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 50 transition count 124
Applied a total of 14 rules in 12 ms. Remains 50 /57 variables (removed 7) and now considering 124/146 (removed 22) transitions.
// Phase 1: matrix 124 rows 50 cols
[2024-06-02 20:51:24] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:51:24] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-02 20:51:24] [INFO ] Invariant cache hit.
[2024-06-02 20:51:24] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-02 20:51:24] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-06-02 20:51:24] [INFO ] Invariant cache hit.
[2024-06-02 20:51:25] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/57 places, 124/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 50/57 places, 124/146 transitions.
Stuttering acceptance computed with spot in 787 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), true, (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p2 p0), acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 11}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=6 dest: 10}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=6 dest: 12}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=6 dest: 13}], [{ cond=(NOT p0), acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 7}], [{ cond=(NOT p0), acceptance={} source=10 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=11 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=11 dest: 14}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=12 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={} source=12 dest: 11}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=13 dest: 9}, { cond=(AND p2 (NOT p0)), acceptance={} source=13 dest: 12}], [{ cond=(NOT p2), acceptance={} source=14 dest: 8}, { cond=p2, acceptance={} source=14 dest: 14}]], initial=0, aps=[p2:(AND (EQ s23 1) (EQ s39 1) (EQ s48 1)), p0:(AND (EQ s3 1) (EQ s9 1) (EQ s17 1)), p1:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-10 finished in 1097 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(p0)||G(F(p1)))))'
Support contains 5 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 146/146 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 51 transition count 127
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 51 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 50 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 50 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 49 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 49 transition count 118
Applied a total of 16 rules in 5 ms. Remains 49 /57 variables (removed 8) and now considering 118/146 (removed 28) transitions.
// Phase 1: matrix 118 rows 49 cols
[2024-06-02 20:51:25] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:51:25] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 20:51:25] [INFO ] Invariant cache hit.
[2024-06-02 20:51:25] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-02 20:51:25] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-06-02 20:51:25] [INFO ] Invariant cache hit.
[2024-06-02 20:51:26] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/57 places, 118/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 49/57 places, 118/146 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s16 1) (EQ s20 1) (EQ s24 1) (EQ s33 1)), p1:(AND (OR (AND (EQ s3 1) (EQ s16 1) (EQ s20 1) (EQ s24 1)) (EQ s33 0)) (EQ s3 1) (EQ s16...], 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 9 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-13 finished in 454 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((X((!p1 U (p2||G(!p1))))&&p0))))'
Support contains 7 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 146/146 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 51 transition count 131
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 51 transition count 131
Applied a total of 12 rules in 4 ms. Remains 51 /57 variables (removed 6) and now considering 131/146 (removed 15) transitions.
// Phase 1: matrix 131 rows 51 cols
[2024-06-02 20:51:26] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 20:51:26] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:51:26] [INFO ] Invariant cache hit.
[2024-06-02 20:51:26] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 20:51:26] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-06-02 20:51:26] [INFO ] Invariant cache hit.
[2024-06-02 20:51:26] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/57 places, 131/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 51/57 places, 131/146 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s23 1) (EQ s33 1)), p2:(AND (NOT (OR (AND (EQ s22 1) (EQ s23 1) (EQ s35 1)) (AND (EQ s3 1) (EQ s4 1) (EQ s16 1)))) (NOT (AND (EQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-14 finished in 490 ms.
All properties solved by simple procedures.
Total runtime 12346 ms.

BK_STOP 1717361488285

--------------------
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-02"
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-02, 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-171734926300008"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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