Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r233-tall-167856419100580.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is MAPK-PT-00160, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419100580
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.7K Feb 26 10:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 10:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 10:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 10:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Feb 26 10:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 25K Mar 5 18:22 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 MAPK-PT-00160-LTLFireability-00
FORMULA_NAME MAPK-PT-00160-LTLFireability-01
FORMULA_NAME MAPK-PT-00160-LTLFireability-02
FORMULA_NAME MAPK-PT-00160-LTLFireability-03
FORMULA_NAME MAPK-PT-00160-LTLFireability-04
FORMULA_NAME MAPK-PT-00160-LTLFireability-05
FORMULA_NAME MAPK-PT-00160-LTLFireability-06
FORMULA_NAME MAPK-PT-00160-LTLFireability-07
FORMULA_NAME MAPK-PT-00160-LTLFireability-08
FORMULA_NAME MAPK-PT-00160-LTLFireability-09
FORMULA_NAME MAPK-PT-00160-LTLFireability-10
FORMULA_NAME MAPK-PT-00160-LTLFireability-11
FORMULA_NAME MAPK-PT-00160-LTLFireability-12
FORMULA_NAME MAPK-PT-00160-LTLFireability-13
FORMULA_NAME MAPK-PT-00160-LTLFireability-14
FORMULA_NAME MAPK-PT-00160-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679554725030

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MAPK-PT-00160
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 06:58:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 06:58:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:58:46] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-23 06:58:46] [INFO ] Transformed 22 places.
[2023-03-23 06:58:46] [INFO ] Transformed 30 transitions.
[2023-03-23 06:58:46] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 84 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MAPK-PT-00160-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00160-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00160-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00160-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00160-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 19 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2023-03-23 06:58:47] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-23 06:58:47] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-23 06:58:47] [INFO ] Invariant cache hit.
[2023-03-23 06:58:47] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-23 06:58:47] [INFO ] Invariant cache hit.
[2023-03-23 06:58:47] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 22/22 places, 30/30 transitions.
Support contains 19 out of 22 places after structural reductions.
[2023-03-23 06:58:47] [INFO ] Flatten gal took : 19 ms
[2023-03-23 06:58:47] [INFO ] Flatten gal took : 5 ms
[2023-03-23 06:58:47] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 10036 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=109 ) properties (out of 18) seen :17
Finished Best-First random walk after 1046 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=87 )
FORMULA MAPK-PT-00160-LTLFireability-05 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 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 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
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 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 11 place count 16 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 16 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 16 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 14 transition count 23
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 14 transition count 23
Applied a total of 16 rules in 11 ms. Remains 14 /22 variables (removed 8) and now considering 23/30 (removed 7) transitions.
[2023-03-23 06:58:48] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
// Phase 1: matrix 18 rows 14 cols
[2023-03-23 06:58:48] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-23 06:58:48] [INFO ] Implicit Places using invariants in 68 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/22 places, 23/30 transitions.
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 12 transition count 20
Applied a total of 3 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 20/23 (removed 3) transitions.
[2023-03-23 06:58:48] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 12 cols
[2023-03-23 06:58:48] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 06:58:48] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-23 06:58:48] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
[2023-03-23 06:58:48] [INFO ] Invariant cache hit.
[2023-03-23 06:58:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 06:58:48] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/22 places, 20/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 148 ms. Remains : 12/22 places, 20/30 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MAPK-PT-00160-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s9 1)), p1:(GEQ s1 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 0 steps with 0 reset in 2 ms.
FORMULA MAPK-PT-00160-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00160-LTLFireability-02 finished in 399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F(p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2023-03-23 06:58:48] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-23 06:58:48] [INFO ] Implicit Places using invariants in 29 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MAPK-PT-00160-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(LT s16 1), p0:(OR (LT s7 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 15997 reset in 223 ms.
Stack based approach found an accepted trace after 1499 steps with 303 reset with depth 32 and stack size 29 in 4 ms.
FORMULA MAPK-PT-00160-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-00160-LTLFireability-03 finished in 561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U G(p1))&&X(G(p2))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-23 06:58:49] [INFO ] Invariant cache hit.
[2023-03-23 06:58:49] [INFO ] Implicit Places using invariants in 37 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : MAPK-PT-00160-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s15 1), p0:(GEQ s16 1), p2:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 0 ms.
FORMULA MAPK-PT-00160-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00160-LTLFireability-04 finished in 274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(!p0))&&F(p1))||G(F(!p0))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-23 06:58:49] [INFO ] Invariant cache hit.
[2023-03-23 06:58:49] [INFO ] Implicit Places using invariants in 41 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 186 ms :[p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : MAPK-PT-00160-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s0 1) (NOT (AND (GEQ s2 1) (GEQ s14 1) (GEQ s17 1)))), p0:(OR (GEQ s0 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 7 factoid took 165 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MAPK-PT-00160-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MAPK-PT-00160-LTLFireability-06 finished in 619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 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 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 21 place count 10 transition count 21
Graph (trivial) has 8 edges and 10 vertex of which 2 / 10 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 23 place count 8 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 7 edges and 8 vertex of which 3 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 28 place count 6 transition count 17
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 36 place count 5 transition count 10
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 5 transition count 6
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 2 with 2 rules applied. Total rules applied 42 place count 4 transition count 5
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 4 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 43 place count 4 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 2 transition count 3
Applied a total of 46 rules in 15 ms. Remains 2 /22 variables (removed 20) and now considering 3/30 (removed 27) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-23 06:58:49] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-23 06:58:49] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-23 06:58:49] [INFO ] Invariant cache hit.
[2023-03-23 06:58:49] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-23 06:58:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 06:58:49] [INFO ] Invariant cache hit.
[2023-03-23 06:58:49] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/22 places, 3/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 2/22 places, 3/30 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-00160-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-00160-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00160-LTLFireability-07 finished in 180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X((p1&&X(p2)))))||G(p3)))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2023-03-23 06:58:50] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-23 06:58:50] [INFO ] Implicit Places using invariants in 44 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : MAPK-PT-00160-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p3 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GEQ s5 1), p1:(GEQ s0 1), p2:(AND (GEQ s7 1) (GEQ s13 1)), p3:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1087 reset in 150 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA MAPK-PT-00160-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-00160-LTLFireability-10 finished in 457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((G(p0)||F(!p1)))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 14 transition count 24
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 14 transition count 20
Applied a total of 18 rules in 4 ms. Remains 14 /22 variables (removed 8) and now considering 20/30 (removed 10) transitions.
[2023-03-23 06:58:50] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 14 cols
[2023-03-23 06:58:50] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-23 06:58:50] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-23 06:58:50] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
[2023-03-23 06:58:50] [INFO ] Invariant cache hit.
[2023-03-23 06:58:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-23 06:58:50] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-23 06:58:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 06:58:50] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
[2023-03-23 06:58:50] [INFO ] Invariant cache hit.
[2023-03-23 06:58:50] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/22 places, 20/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 14/22 places, 20/30 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : MAPK-PT-00160-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s9 1), p1:(AND (GEQ s0 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 36 steps with 7 reset in 0 ms.
FORMULA MAPK-PT-00160-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00160-LTLFireability-11 finished in 356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(p1&&(!p0 U (G(!p0)||(!p0&&G(!p2))))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 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 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 13 rules applied. Total rules applied 16 place count 13 transition count 23
Graph (trivial) has 4 edges and 13 vertex of which 2 / 13 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 12 transition count 23
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 20 place count 12 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 12 transition count 19
Applied a total of 21 rules in 6 ms. Remains 12 /22 variables (removed 10) and now considering 19/30 (removed 11) transitions.
[2023-03-23 06:58:50] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 12 cols
[2023-03-23 06:58:50] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-23 06:58:50] [INFO ] Implicit Places using invariants in 34 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/22 places, 19/30 transitions.
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 16
Applied a total of 3 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 16/19 (removed 3) transitions.
[2023-03-23 06:58:50] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 10 cols
[2023-03-23 06:58:50] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-23 06:58:50] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-23 06:58:50] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-23 06:58:50] [INFO ] Invariant cache hit.
[2023-03-23 06:58:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 06:58:50] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/22 places, 16/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 110 ms. Remains : 10/22 places, 16/30 transitions.
Stuttering acceptance computed with spot in 207 ms :[p0, (AND p0 p2), p0, (AND p0 p2)]
Running random walk in product with property : MAPK-PT-00160-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={1} source=1 dest: 3}], [{ cond=p0, acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND p2 p0), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s7 1), p0:(AND (GEQ s7 1) (GEQ s6 1)), p2:(GEQ s1 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-00160-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00160-LTLFireability-12 finished in 341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1||G(p2)))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2023-03-23 06:58:51] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-23 06:58:51] [INFO ] Implicit Places using invariants in 34 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MAPK-PT-00160-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(OR (LT s6 1) (LT s8 1)), p0:(OR (LT s6 1) (LT s8 1) (LT s1 1)), p1:(GEQ s17 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 87 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-00160-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00160-LTLFireability-13 finished in 191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-23 06:58:51] [INFO ] Invariant cache hit.
[2023-03-23 06:58:51] [INFO ] Implicit Places using invariants in 31 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MAPK-PT-00160-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s5 1), p1:(AND (GEQ s8 1) (GEQ s9 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00160-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00160-LTLFireability-14 finished in 197 ms.
All properties solved by simple procedures.
Total runtime 4971 ms.
ITS solved all properties within timeout

BK_STOP 1679554732484

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="MAPK-PT-00160"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is MAPK-PT-00160, 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 r233-tall-167856419100580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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