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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 18K 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-01-LTLFireability-00
FORMULA_NAME MedleyA-PT-01-LTLFireability-01
FORMULA_NAME MedleyA-PT-01-LTLFireability-02
FORMULA_NAME MedleyA-PT-01-LTLFireability-03
FORMULA_NAME MedleyA-PT-01-LTLFireability-04
FORMULA_NAME MedleyA-PT-01-LTLFireability-05
FORMULA_NAME MedleyA-PT-01-LTLFireability-06
FORMULA_NAME MedleyA-PT-01-LTLFireability-07
FORMULA_NAME MedleyA-PT-01-LTLFireability-08
FORMULA_NAME MedleyA-PT-01-LTLFireability-09
FORMULA_NAME MedleyA-PT-01-LTLFireability-10
FORMULA_NAME MedleyA-PT-01-LTLFireability-11
FORMULA_NAME MedleyA-PT-01-LTLFireability-12
FORMULA_NAME MedleyA-PT-01-LTLFireability-13
FORMULA_NAME MedleyA-PT-01-LTLFireability-14
FORMULA_NAME MedleyA-PT-01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717361415689

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-01
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 20:50:18] [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:50:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:50:18] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-06-02 20:50:18] [INFO ] Transformed 61 places.
[2024-06-02 20:50:18] [INFO ] Transformed 53 transitions.
[2024-06-02 20:50:18] [INFO ] Found NUPN structural information;
[2024-06-02 20:50:18] [INFO ] Parsed PT model containing 61 places and 53 transitions and 210 arcs in 169 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 2 formulas.
FORMULA MedleyA-PT-01-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-01-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 16 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 20:50:19] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
// Phase 1: matrix 52 rows 61 cols
[2024-06-02 20:50:19] [INFO ] Computed 20 invariants in 9 ms
[2024-06-02 20:50:19] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-06-02 20:50:19] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 20:50:19] [INFO ] Invariant cache hit.
[2024-06-02 20:50:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-02 20:50:19] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-06-02 20:50:19] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 20:50:19] [INFO ] Invariant cache hit.
[2024-06-02 20:50:19] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 592 ms. Remains : 61/61 places, 53/53 transitions.
Support contains 37 out of 61 places after structural reductions.
[2024-06-02 20:50:20] [INFO ] Flatten gal took : 35 ms
[2024-06-02 20:50:20] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:50:20] [INFO ] Input system was already deterministic with 53 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 792 ms. (steps per millisecond=12 ) properties (out of 28) seen :22
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 20:50:21] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 20:50:21] [INFO ] Invariant cache hit.
[2024-06-02 20:50:21] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2024-06-02 20:50:21] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-06-02 20:50:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-02 20:50:21] [INFO ] After 19ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 20:50:21] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 20:50:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2024-06-02 20:50:21] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 20:50:21] [INFO ] After 21ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 20:50:21] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 4 ms to minimize.
[2024-06-02 20:50:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-06-02 20:50:21] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:50:21] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:50:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2024-06-02 20:50:21] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-06-02 20:50:21] [INFO ] After 356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 53/53 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 51
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 61 transition count 50
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 60 transition count 50
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 1 with 2 rules applied. Total rules applied 6 place count 59 transition count 49
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 59 transition count 48
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 58 transition count 47
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 58 transition count 47
Applied a total of 10 rules in 37 ms. Remains 58 /61 variables (removed 3) and now considering 47/53 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 58/61 places, 47/53 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 47 rows 58 cols
[2024-06-02 20:50:21] [INFO ] Computed 20 invariants in 7 ms
[2024-06-02 20:50:21] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2024-06-02 20:50:22] [INFO ] After 38ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 20:50:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-02 20:50:22] [INFO ] After 11ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:50:22] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:50:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2024-06-02 20:50:22] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 20:50:22] [INFO ] After 10ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 20:50:22] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-06-02 20:50:22] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 47/47 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 46
Reduce places removed 4 places and 0 transitions.
Graph (trivial) has 10 edges and 53 vertex of which 2 / 53 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 52 transition count 46
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 52 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 52 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 51 transition count 43
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 21 place count 44 transition count 39
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 2 with 6 rules applied. Total rules applied 27 place count 41 transition count 36
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 35 place count 41 transition count 28
Reduce places removed 11 places and 0 transitions.
Graph (complete) has 50 edges and 30 vertex of which 10 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 18 output transitions
Drop transitions removed 18 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 2 with 13 rules applied. Total rules applied 48 place count 10 transition count 9
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 51 place count 9 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 51 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 55 place count 7 transition count 5
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 56 place count 6 transition count 5
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 5 with 2 rules applied. Total rules applied 58 place count 5 transition count 4
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 59 place count 5 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 60 place count 4 transition count 3
Applied a total of 60 rules in 31 ms. Remains 4 /58 variables (removed 54) and now considering 3/47 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 4/58 places, 3/47 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
FORMULA MedleyA-PT-01-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 1 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(X(G(p0)))&&(F(G(p1))||G(p2))))'
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 20:50:22] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
// Phase 1: matrix 52 rows 61 cols
[2024-06-02 20:50:22] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:50:22] [INFO ] Implicit Places using invariants in 113 ms returned [53, 54]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 115 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/61 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 59/61 places, 53/53 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 428 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), true]
Running random walk in product with property : MedleyA-PT-01-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s4 1) (EQ s5 1)), p1:(EQ s18 1), p0:(OR (EQ s20 0) (EQ s21 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 419 ms.
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-01-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-01-LTLFireability-00 finished in 1057 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) U p1))'
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 53/53 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 61 transition count 52
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 60 transition count 52
Applied a total of 2 rules in 10 ms. Remains 60 /61 variables (removed 1) and now considering 52/53 (removed 1) transitions.
[2024-06-02 20:50:23] [INFO ] Flow matrix only has 51 transitions (discarded 1 similar events)
// Phase 1: matrix 51 rows 60 cols
[2024-06-02 20:50:23] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:50:23] [INFO ] Implicit Places using invariants in 107 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/61 places, 52/53 transitions.
Graph (trivial) has 7 edges and 59 vertex of which 2 / 59 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 6 ms. Remains 58 /59 variables (removed 1) and now considering 50/52 (removed 2) transitions.
[2024-06-02 20:50:23] [INFO ] Flow matrix only has 49 transitions (discarded 1 similar events)
// Phase 1: matrix 49 rows 58 cols
[2024-06-02 20:50:23] [INFO ] Computed 19 invariants in 8 ms
[2024-06-02 20:50:23] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 20:50:23] [INFO ] Flow matrix only has 49 transitions (discarded 1 similar events)
[2024-06-02 20:50:23] [INFO ] Invariant cache hit.
[2024-06-02 20:50:24] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-02 20:50:24] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 58/61 places, 50/53 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 359 ms. Remains : 58/61 places, 50/53 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : MedleyA-PT-01-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s52 1)), p0:(AND (NOT (AND (EQ s50 1) (EQ s52 1))) (NOT (AND (EQ s24 1) (EQ s31 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-01-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-01-LTLFireability-01 finished in 578 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' '!(((!p0&&X(!p1)) U X(X(G(p0)))))'
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 20:50:24] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
// Phase 1: matrix 52 rows 61 cols
[2024-06-02 20:50:24] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 20:50:24] [INFO ] Implicit Places using invariants in 90 ms returned [53, 54]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 92 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/61 places, 53/53 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 59/61 places, 53/53 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-01-LTLFireability-02 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=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=true, 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 s35 1) (EQ s41 1)), p1:(AND (EQ s26 1) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-01-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-01-LTLFireability-02 finished in 314 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||G(p1))))'
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 20:50:24] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 20:50:24] [INFO ] Invariant cache hit.
[2024-06-02 20:50:24] [INFO ] Implicit Places using invariants in 76 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 60/61 places, 53/53 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-01-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, 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}]], initial=1, aps=[p1:(AND (EQ s51 1) (EQ s53 1)), p0:(AND (EQ s40 1) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-01-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-01-LTLFireability-03 finished in 243 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(F(p0))))'
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 20:50:24] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 20:50:24] [INFO ] Invariant cache hit.
[2024-06-02 20:50:24] [INFO ] Implicit Places using invariants in 94 ms returned [53, 54]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 97 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 59/61 places, 53/53 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-01-LTLFireability-04 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: 1}]], initial=2, aps=[p0:(OR (EQ s26 0) (EQ s30 0))], 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 44 steps with 14 reset in 2 ms.
FORMULA MedleyA-PT-01-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-01-LTLFireability-04 finished in 237 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(F(p0))))'
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 20:50:25] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 20:50:25] [INFO ] Invariant cache hit.
[2024-06-02 20:50:25] [INFO ] Implicit Places using invariants in 78 ms returned [53, 54]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 82 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 59/61 places, 53/53 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-01-LTLFireability-05 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: 1}]], initial=2, aps=[p0:(AND (EQ s4 1) (EQ s5 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 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-01-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-01-LTLFireability-05 finished in 235 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 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 13 edges and 58 vertex of which 2 / 58 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 57 transition count 52
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 56 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 56 transition count 49
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 55 transition count 49
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 47 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 14 edges and 47 vertex of which 3 / 47 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 45 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 24 place count 45 transition count 42
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 4 with 6 rules applied. Total rules applied 30 place count 42 transition count 39
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 42 transition count 38
Applied a total of 31 rules in 30 ms. Remains 42 /61 variables (removed 19) and now considering 38/53 (removed 15) transitions.
[2024-06-02 20:50:25] [INFO ] Flow matrix only has 36 transitions (discarded 2 similar events)
// Phase 1: matrix 36 rows 42 cols
[2024-06-02 20:50:25] [INFO ] Computed 13 invariants in 1 ms
[2024-06-02 20:50:25] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 20:50:25] [INFO ] Flow matrix only has 36 transitions (discarded 2 similar events)
[2024-06-02 20:50:25] [INFO ] Invariant cache hit.
[2024-06-02 20:50:25] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-06-02 20:50:25] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 20:50:25] [INFO ] Flow matrix only has 36 transitions (discarded 2 similar events)
[2024-06-02 20:50:25] [INFO ] Invariant cache hit.
[2024-06-02 20:50:25] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/61 places, 38/53 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 250 ms. Remains : 42/61 places, 38/53 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-01-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s34 1) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-01-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-01-LTLFireability-06 finished in 307 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((G((p0||F(!p1))) U p2))))'
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 53/53 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 61 transition count 52
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 60 transition count 52
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 4 place count 59 transition count 51
Applied a total of 4 rules in 8 ms. Remains 59 /61 variables (removed 2) and now considering 51/53 (removed 2) transitions.
[2024-06-02 20:50:25] [INFO ] Flow matrix only has 50 transitions (discarded 1 similar events)
// Phase 1: matrix 50 rows 59 cols
[2024-06-02 20:50:25] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 20:50:25] [INFO ] Implicit Places using invariants in 86 ms returned [49, 52, 53]
[2024-06-02 20:50:25] [INFO ] Actually due to overlaps returned [52, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 87 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/61 places, 51/53 transitions.
Graph (trivial) has 10 edges and 57 vertex of which 2 / 57 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 7 place count 53 transition count 46
Applied a total of 7 rules in 9 ms. Remains 53 /57 variables (removed 4) and now considering 46/51 (removed 5) transitions.
[2024-06-02 20:50:25] [INFO ] Flow matrix only has 45 transitions (discarded 1 similar events)
// Phase 1: matrix 45 rows 53 cols
[2024-06-02 20:50:25] [INFO ] Computed 18 invariants in 1 ms
[2024-06-02 20:50:25] [INFO ] Implicit Places using invariants in 67 ms returned [7, 22, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 68 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/61 places, 46/53 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 48 transition count 44
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 47 transition count 45
Applied a total of 6 rules in 8 ms. Remains 47 /50 variables (removed 3) and now considering 45/46 (removed 1) transitions.
[2024-06-02 20:50:25] [INFO ] Flow matrix only has 43 transitions (discarded 2 similar events)
// Phase 1: matrix 43 rows 47 cols
[2024-06-02 20:50:25] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 20:50:25] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 20:50:25] [INFO ] Flow matrix only has 43 transitions (discarded 2 similar events)
[2024-06-02 20:50:25] [INFO ] Invariant cache hit.
[2024-06-02 20:50:25] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 20:50:25] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 47/61 places, 45/53 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 323 ms. Remains : 47/61 places, 45/53 transitions.
Stuttering acceptance computed with spot in 309 ms :[(NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p2))]
Running random walk in product with property : MedleyA-PT-01-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND p2 p1) (AND p0 p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=3 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND p2 (NOT p0) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p2 p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s2 1), p0:(AND (EQ s26 1) (EQ s35 1)), p1:(AND (EQ s39 1) (EQ s46 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 190 ms.
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-01-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-01-LTLFireability-07 finished in 850 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((F(G(p0))&&(!p1 U (p2||G(!p1))))))'
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 53/53 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 61 transition count 52
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 60 transition count 52
Applied a total of 2 rules in 5 ms. Remains 60 /61 variables (removed 1) and now considering 52/53 (removed 1) transitions.
[2024-06-02 20:50:26] [INFO ] Flow matrix only has 51 transitions (discarded 1 similar events)
// Phase 1: matrix 51 rows 60 cols
[2024-06-02 20:50:26] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 20:50:26] [INFO ] Implicit Places using invariants in 83 ms returned [53, 54]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 85 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/61 places, 52/53 transitions.
Graph (trivial) has 8 edges and 58 vertex of which 2 / 58 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 7 place count 54 transition count 47
Applied a total of 7 rules in 7 ms. Remains 54 /58 variables (removed 4) and now considering 47/52 (removed 5) transitions.
[2024-06-02 20:50:26] [INFO ] Flow matrix only has 46 transitions (discarded 1 similar events)
// Phase 1: matrix 46 rows 54 cols
[2024-06-02 20:50:26] [INFO ] Computed 18 invariants in 1 ms
[2024-06-02 20:50:26] [INFO ] Implicit Places using invariants in 75 ms returned [7, 22, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 76 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/61 places, 47/53 transitions.
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 6 place count 48 transition count 44
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
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 12 place count 45 transition count 51
Applied a total of 12 rules in 6 ms. Remains 45 /51 variables (removed 6) and now considering 51/47 (removed -4) transitions.
[2024-06-02 20:50:26] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
// Phase 1: matrix 48 rows 45 cols
[2024-06-02 20:50:26] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 20:50:26] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 20:50:26] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2024-06-02 20:50:26] [INFO ] Invariant cache hit.
[2024-06-02 20:50:26] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-02 20:50:26] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 45/61 places, 51/53 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 338 ms. Remains : 45/61 places, 51/53 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : MedleyA-PT-01-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NOT (OR (AND (EQ s7 1) (EQ s11 1)) (AND (EQ s38 1) (EQ s41 1)))) (NOT (AND (EQ s38 1) (EQ s41 1)))), p0:(OR (EQ s38 0) (EQ s41 0)), p1:(AND (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-01-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-01-LTLFireability-08 finished in 507 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) U X((G(F(!p0))&&p1))))'
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 20:50:26] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
// Phase 1: matrix 52 rows 61 cols
[2024-06-02 20:50:26] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 20:50:27] [INFO ] Implicit Places using invariants in 81 ms returned [53, 54]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 82 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/61 places, 53/53 transitions.
Applied a total of 0 rules in 0 ms. Remains 59 /59 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 59/61 places, 53/53 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (NOT p0), p0, p0]
Running random walk in product with property : MedleyA-PT-01-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s52 1), p1:(AND (EQ s17 1) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 1 reset in 0 ms.
FORMULA MedleyA-PT-01-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-01-LTLFireability-12 finished in 373 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||G(p1)))))'
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 20:50:27] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 20:50:27] [INFO ] Invariant cache hit.
[2024-06-02 20:50:27] [INFO ] Implicit Places using invariants in 78 ms returned [53, 54]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 82 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/61 places, 53/53 transitions.
Graph (trivial) has 9 edges and 59 vertex of which 2 / 59 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 7 place count 55 transition count 48
Applied a total of 7 rules in 9 ms. Remains 55 /59 variables (removed 4) and now considering 48/53 (removed 5) transitions.
[2024-06-02 20:50:27] [INFO ] Flow matrix only has 47 transitions (discarded 1 similar events)
// Phase 1: matrix 47 rows 55 cols
[2024-06-02 20:50:27] [INFO ] Computed 18 invariants in 1 ms
[2024-06-02 20:50:27] [INFO ] Implicit Places using invariants in 77 ms returned [7, 22, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 78 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/61 places, 48/53 transitions.
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 6 place count 49 transition count 45
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
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 12 place count 46 transition count 52
Applied a total of 12 rules in 9 ms. Remains 46 /52 variables (removed 6) and now considering 52/48 (removed -4) transitions.
[2024-06-02 20:50:27] [INFO ] Flow matrix only has 49 transitions (discarded 3 similar events)
// Phase 1: matrix 49 rows 46 cols
[2024-06-02 20:50:27] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 20:50:27] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 20:50:27] [INFO ] Flow matrix only has 49 transitions (discarded 3 similar events)
[2024-06-02 20:50:27] [INFO ] Invariant cache hit.
[2024-06-02 20:50:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-02 20:50:27] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 46/61 places, 52/53 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 360 ms. Remains : 46/61 places, 52/53 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-01-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s44 0), p0:(AND (EQ s38 1) (EQ s45 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 14 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-01-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-01-LTLFireability-13 finished in 468 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(p0) U p1)&&G(F(!(p2 U p1)))))))'
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 20:50:27] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
// Phase 1: matrix 52 rows 61 cols
[2024-06-02 20:50:27] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 20:50:27] [INFO ] Implicit Places using invariants in 87 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/61 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 60/61 places, 53/53 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, true, p1, (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : MedleyA-PT-01-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s51 1) (EQ s53 1)), p2:(EQ s52 1), p0:(AND (EQ s11 1) (EQ s56 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 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-01-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-01-LTLFireability-14 finished in 324 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&&X(p0)))||(G(!p1) U p2)))'
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 20:50:28] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 20:50:28] [INFO ] Invariant cache hit.
[2024-06-02 20:50:28] [INFO ] Implicit Places using invariants in 89 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/61 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 60/61 places, 53/53 transitions.
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-01-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 1}]], initial=0, aps=[p0:(OR (EQ s50 0) (EQ s53 0)), p2:(AND (EQ s24 1) (EQ s32 1)), p1:(AND (EQ s24 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-01-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-01-LTLFireability-15 finished in 385 ms.
All properties solved by simple procedures.
Total runtime 9851 ms.

BK_STOP 1717361430202

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

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