About the Execution of 2023-gold for RefineWMG-PT-025025
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
334.907 | 11780.00 | 20262.00 | 487.20 | FTFFFFFFFFFFFFFF | normal |
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.r329-tall-171662362300453.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 RefineWMG-PT-025025, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662362300453
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 05:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 13 05:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 05:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 13 05:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 56K May 18 16:43 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 RefineWMG-PT-025025-LTLFireability-00
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-01
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-02
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-03
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-04
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-05
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-06
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-07
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-08
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-09
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-10
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-11
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-12
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-13
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-14
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716863385921
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=RefineWMG-PT-025025
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 02:29:47] [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-05-28 02:29:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:29:47] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2024-05-28 02:29:47] [INFO ] Transformed 129 places.
[2024-05-28 02:29:47] [INFO ] Transformed 103 transitions.
[2024-05-28 02:29:47] [INFO ] Parsed PT model containing 129 places and 103 transitions and 308 arcs in 98 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA RefineWMG-PT-025025-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025025-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 15 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2024-05-28 02:29:47] [INFO ] Computed 52 invariants in 9 ms
[2024-05-28 02:29:48] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
[2024-05-28 02:29:48] [INFO ] Invariant cache hit.
[2024-05-28 02:29:48] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-28 02:29:48] [INFO ] Invariant cache hit.
[2024-05-28 02:29:48] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-28 02:29:48] [INFO ] Invariant cache hit.
[2024-05-28 02:29:48] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 729 ms. Remains : 129/129 places, 103/103 transitions.
Support contains 38 out of 129 places after structural reductions.
[2024-05-28 02:29:48] [INFO ] Flatten gal took : 28 ms
[2024-05-28 02:29:48] [INFO ] Flatten gal took : 11 ms
[2024-05-28 02:29:48] [INFO ] Input system was already deterministic with 103 transitions.
Incomplete random walk after 10018 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 27) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2024-05-28 02:29:48] [INFO ] Invariant cache hit.
[2024-05-28 02:29:49] [INFO ] [Real]Absence check using 52 positive place invariants in 12 ms returned sat
[2024-05-28 02:29:49] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-28 02:29:49] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2024-05-28 02:29:49] [INFO ] After 313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-05-28 02:29:50] [INFO ] After 520ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 132 ms.
[2024-05-28 02:29:50] [INFO ] After 1043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 15 different solutions.
Finished Parikh walk after 1016 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=169 )
Parikh walk visited 16 properties in 47 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 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' '!(F(p0))'
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 74 edges and 129 vertex of which 50 / 129 are part of one of the 25 SCC in 2 ms
Free SCC test removed 25 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 79 transition count 54
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 97 place count 31 transition count 30
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 22 rules applied. Total rules applied 119 place count 31 transition count 8
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 141 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 141 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 8 transition count 7
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 3 with 2 rules applied. Total rules applied 145 place count 7 transition count 6
Applied a total of 145 rules in 14 ms. Remains 7 /129 variables (removed 122) and now considering 6/103 (removed 97) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-28 02:29:50] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 02:29:50] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2024-05-28 02:29:50] [INFO ] Invariant cache hit.
[2024-05-28 02:29:50] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 02:29:50] [INFO ] Invariant cache hit.
[2024-05-28 02:29:50] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-28 02:29:50] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:29:50] [INFO ] Invariant cache hit.
[2024-05-28 02:29:50] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/129 places, 6/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 7/129 places, 6/103 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 136 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s5 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 2 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-02 finished in 319 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)&&F(G(p1)))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 72 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 96 place count 33 transition count 32
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 20 rules applied. Total rules applied 116 place count 33 transition count 12
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 136 place count 13 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 136 place count 13 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 11 transition count 10
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 3 with 2 rules applied. Total rules applied 142 place count 10 transition count 9
Applied a total of 142 rules in 8 ms. Remains 10 /129 variables (removed 119) and now considering 9/103 (removed 94) transitions.
// Phase 1: matrix 9 rows 10 cols
[2024-05-28 02:29:51] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 02:29:51] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2024-05-28 02:29:51] [INFO ] Invariant cache hit.
[2024-05-28 02:29:51] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 02:29:51] [INFO ] Invariant cache hit.
[2024-05-28 02:29:51] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-28 02:29:51] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-28 02:29:51] [INFO ] Invariant cache hit.
[2024-05-28 02:29:51] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/129 places, 9/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 10/129 places, 9/103 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s6 1), p1:(LT s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-03 finished in 279 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)||F((G(p1)||G(!p0)))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 71 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 98 place count 33 transition count 33
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 21 rules applied. Total rules applied 119 place count 33 transition count 12
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 140 place count 12 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 140 place count 12 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 11 transition count 11
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 3 with 2 rules applied. Total rules applied 144 place count 10 transition count 10
Applied a total of 144 rules in 12 ms. Remains 10 /129 variables (removed 119) and now considering 10/103 (removed 93) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-05-28 02:29:51] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 02:29:51] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2024-05-28 02:29:51] [INFO ] Invariant cache hit.
[2024-05-28 02:29:51] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 02:29:51] [INFO ] Invariant cache hit.
[2024-05-28 02:29:51] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-28 02:29:51] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-28 02:29:51] [INFO ] Invariant cache hit.
[2024-05-28 02:29:51] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/129 places, 10/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 10/129 places, 10/103 transitions.
Stuttering acceptance computed with spot in 73 ms :[false, (AND p0 (NOT p1))]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(LT s6 1), p1:(GEQ s9 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 275 ms.
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-04 finished in 497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U (p1&&X(X(X(G(!p2))))))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2024-05-28 02:29:51] [INFO ] Computed 52 invariants in 3 ms
[2024-05-28 02:29:51] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
[2024-05-28 02:29:51] [INFO ] Invariant cache hit.
[2024-05-28 02:29:51] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 02:29:51] [INFO ] Invariant cache hit.
[2024-05-28 02:29:52] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-28 02:29:52] [INFO ] Invariant cache hit.
[2024-05-28 02:29:52] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 302 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 649 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (NOT p0), p2, (AND (NOT p0) p2), p2, (AND (NOT p0) p2), p2, p2, (AND (NOT p0) p2), p2, p2, p2]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={0} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 6}, { cond=p1, acceptance={0} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 8}, { cond=(NOT p1), acceptance={} source=5 dest: 9}, { cond=p1, acceptance={0} source=5 dest: 10}], [{ cond=true, acceptance={} source=6 dest: 9}], [{ cond=p1, acceptance={} source=7 dest: 4}, { cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=(NOT p1), acceptance={0} source=7 dest: 11}, { cond=p1, acceptance={0} source=7 dest: 12}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=8 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=8 dest: 3}, { cond=p1, acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 9}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 10}], [{ cond=p2, acceptance={} source=9 dest: 2}, { cond=(NOT p2), acceptance={} source=9 dest: 9}], [{ cond=p1, acceptance={} source=10 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=10 dest: 5}, { cond=(NOT p1), acceptance={} source=10 dest: 6}, { cond=(AND p1 p2), acceptance={0} source=10 dest: 7}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 11}, { cond=(AND p1 (NOT p2)), acceptance={} source=10 dest: 12}], [{ cond=p1, acceptance={} source=11 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p1) p2), acceptance={0} source=11 dest: 8}, { cond=(NOT p1), acceptance={} source=11 dest: 9}, { cond=(AND p1 (NOT p2)), acceptance={} source=11 dest: 10}, { cond=(AND p1 p2), acceptance={0} source=11 dest: 10}], [{ cond=p1, acceptance={} source=12 dest: 4}, { cond=(NOT p1), acceptance={} source=12 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p1) p2), acceptance={0} source=12 dest: 11}, { cond=(AND p1 (NOT p2)), acceptance={} source=12 dest: 12}, { cond=(AND p1 p2), acceptance={0} source=12 dest: 12}]], initial=0, aps=[p1:(GEQ s57 1), p0:(GEQ s3 3), p2:(OR (GEQ s7 1) (GEQ s3 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[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]]
Product exploration explored 100000 steps with 0 reset in 413 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-05 finished in 1395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||(!p0&&X(X(G(p1)))))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 11 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-28 02:29:53] [INFO ] Invariant cache hit.
[2024-05-28 02:29:53] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
[2024-05-28 02:29:53] [INFO ] Invariant cache hit.
[2024-05-28 02:29:53] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-28 02:29:53] [INFO ] Invariant cache hit.
[2024-05-28 02:29:53] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-28 02:29:53] [INFO ] Invariant cache hit.
[2024-05-28 02:29:53] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(LT s103 1), p0:(GEQ s48 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 68 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-06 finished in 518 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)&&F(G(p1)))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 70 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 95 place count 35 transition count 34
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 20 rules applied. Total rules applied 115 place count 35 transition count 14
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 135 place count 15 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 135 place count 15 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 14 transition count 13
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 3 with 2 rules applied. Total rules applied 139 place count 13 transition count 12
Applied a total of 139 rules in 16 ms. Remains 13 /129 variables (removed 116) and now considering 12/103 (removed 91) transitions.
// Phase 1: matrix 12 rows 13 cols
[2024-05-28 02:29:53] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 02:29:53] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2024-05-28 02:29:53] [INFO ] Invariant cache hit.
[2024-05-28 02:29:53] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 02:29:53] [INFO ] Invariant cache hit.
[2024-05-28 02:29:53] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-28 02:29:53] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-28 02:29:53] [INFO ] Invariant cache hit.
[2024-05-28 02:29:53] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/129 places, 12/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 13/129 places, 12/103 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s12 1)), p1:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-07 finished in 296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 72 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 96 place count 33 transition count 32
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 21 rules applied. Total rules applied 117 place count 33 transition count 11
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 138 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 138 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 11 transition count 10
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 3 with 2 rules applied. Total rules applied 142 place count 10 transition count 9
Applied a total of 142 rules in 9 ms. Remains 10 /129 variables (removed 119) and now considering 9/103 (removed 94) transitions.
// Phase 1: matrix 9 rows 10 cols
[2024-05-28 02:29:53] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 02:29:54] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2024-05-28 02:29:54] [INFO ] Invariant cache hit.
[2024-05-28 02:29:54] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 02:29:54] [INFO ] Invariant cache hit.
[2024-05-28 02:29:54] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-28 02:29:54] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-28 02:29:54] [INFO ] Invariant cache hit.
[2024-05-28 02:29:54] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/129 places, 9/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 10/129 places, 9/103 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s8 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-08 finished in 204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0)&&F(p1))||X(G(!p0))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2024-05-28 02:29:54] [INFO ] Computed 52 invariants in 1 ms
[2024-05-28 02:29:54] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
[2024-05-28 02:29:54] [INFO ] Invariant cache hit.
[2024-05-28 02:29:54] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-28 02:29:54] [INFO ] Invariant cache hit.
[2024-05-28 02:29:54] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-28 02:29:54] [INFO ] Invariant cache hit.
[2024-05-28 02:29:54] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 281 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 233 ms :[p0, p0, (AND (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s25 1), p0:(AND (GEQ s46 1) (GEQ s47 1) (GEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 184 reset in 441 ms.
Stack based approach found an accepted trace after 559 steps with 0 reset with depth 560 and stack size 550 in 3 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-09 finished in 978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||(p0&&G(p1)))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-28 02:29:55] [INFO ] Invariant cache hit.
[2024-05-28 02:29:55] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
[2024-05-28 02:29:55] [INFO ] Invariant cache hit.
[2024-05-28 02:29:55] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-28 02:29:55] [INFO ] Invariant cache hit.
[2024-05-28 02:29:55] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-28 02:29:55] [INFO ] Invariant cache hit.
[2024-05-28 02:29:55] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GEQ s4 5), p1:(GEQ s5 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 0 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-10 finished in 437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 72 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 96 place count 33 transition count 32
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 21 rules applied. Total rules applied 117 place count 33 transition count 11
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 138 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 138 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 11 transition count 10
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 3 with 2 rules applied. Total rules applied 142 place count 10 transition count 9
Applied a total of 142 rules in 10 ms. Remains 10 /129 variables (removed 119) and now considering 9/103 (removed 94) transitions.
// Phase 1: matrix 9 rows 10 cols
[2024-05-28 02:29:55] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 02:29:55] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2024-05-28 02:29:55] [INFO ] Invariant cache hit.
[2024-05-28 02:29:55] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 02:29:55] [INFO ] Invariant cache hit.
[2024-05-28 02:29:55] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-28 02:29:55] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-28 02:29:55] [INFO ] Invariant cache hit.
[2024-05-28 02:29:55] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/129 places, 9/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 10/129 places, 9/103 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-11 finished in 187 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)&&(p1 U G(!p1))))'
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 70 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 1 with 66 rules applied. Total rules applied 90 place count 37 transition count 34
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 17 rules applied. Total rules applied 107 place count 37 transition count 17
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 124 place count 20 transition count 17
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 124 place count 20 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 130 place count 17 transition count 14
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 3 with 2 rules applied. Total rules applied 132 place count 16 transition count 13
Applied a total of 132 rules in 6 ms. Remains 16 /129 variables (removed 113) and now considering 13/103 (removed 90) transitions.
// Phase 1: matrix 13 rows 16 cols
[2024-05-28 02:29:55] [INFO ] Computed 6 invariants in 0 ms
[2024-05-28 02:29:55] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-28 02:29:55] [INFO ] Invariant cache hit.
[2024-05-28 02:29:55] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 02:29:55] [INFO ] Invariant cache hit.
[2024-05-28 02:29:55] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-28 02:29:55] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-28 02:29:55] [INFO ] Invariant cache hit.
[2024-05-28 02:29:55] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/129 places, 13/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 16/129 places, 13/103 transitions.
Stuttering acceptance computed with spot in 190 ms :[p1, true, p1, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=p1, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p1:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s12 1)), p0:(AND (GEQ s14 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-13 finished in 355 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) U p1)||(G(G(F(p3)))&&p2))))'
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 71 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 93 place count 35 transition count 33
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 19 rules applied. Total rules applied 112 place count 35 transition count 14
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 131 place count 16 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 131 place count 16 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 14 transition count 12
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 3 with 2 rules applied. Total rules applied 137 place count 13 transition count 11
Applied a total of 137 rules in 10 ms. Remains 13 /129 variables (removed 116) and now considering 11/103 (removed 92) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 02:29:56] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 02:29:56] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2024-05-28 02:29:56] [INFO ] Invariant cache hit.
[2024-05-28 02:29:56] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 02:29:56] [INFO ] Invariant cache hit.
[2024-05-28 02:29:56] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-28 02:29:56] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-28 02:29:56] [INFO ] Invariant cache hit.
[2024-05-28 02:29:56] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/129 places, 11/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 13/129 places, 11/103 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s5 1), p2:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s12 1)), p3:(LT s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-14 finished in 278 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 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 69 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 3 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 92 place count 37 transition count 35
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 18 rules applied. Total rules applied 110 place count 37 transition count 17
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 128 place count 19 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 128 place count 19 transition count 15
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 132 place count 17 transition count 15
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 3 with 2 rules applied. Total rules applied 134 place count 16 transition count 14
Applied a total of 134 rules in 12 ms. Remains 16 /129 variables (removed 113) and now considering 14/103 (removed 89) transitions.
// Phase 1: matrix 14 rows 16 cols
[2024-05-28 02:29:56] [INFO ] Computed 6 invariants in 0 ms
[2024-05-28 02:29:56] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2024-05-28 02:29:56] [INFO ] Invariant cache hit.
[2024-05-28 02:29:56] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 02:29:56] [INFO ] Invariant cache hit.
[2024-05-28 02:29:56] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-28 02:29:56] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-28 02:29:56] [INFO ] Invariant cache hit.
[2024-05-28 02:29:56] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/129 places, 14/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 16/129 places, 14/103 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1) (OR (LT s12 1) (LT s13 1) (LT s15 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 RefineWMG-PT-025025-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-15 finished in 207 ms.
All properties solved by simple procedures.
Total runtime 9174 ms.
BK_STOP 1716863397701
--------------------
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="RefineWMG-PT-025025"
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 RefineWMG-PT-025025, 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 r329-tall-171662362300453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-025025.tgz
mv RefineWMG-PT-025025 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 '
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 ;