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.r169-tall-167838856600900.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 GPPP-PT-C1000N0000001000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856600900
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 4.7K Feb 26 10:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 10:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 10:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 10:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 26 10:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 26 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 131K Feb 26 10:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C1000N0000001000-LTLFireability-00
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLFireability-01
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLFireability-02
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLFireability-03
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLFireability-04
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLFireability-05
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLFireability-06
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLFireability-07
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLFireability-08
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLFireability-09
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLFireability-10
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLFireability-11
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLFireability-12
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLFireability-13
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLFireability-14
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678661920427

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=GPPP-PT-C1000N0000001000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 22:58:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 22:58:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 22:58:42] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2023-03-12 22:58:42] [INFO ] Transformed 33 places.
[2023-03-12 22:58:42] [INFO ] Transformed 22 transitions.
[2023-03-12 22:58:42] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:42] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-12 22:58:42] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:42] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-12 22:58:42] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:42] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:58:42] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:42] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:58:43] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 28 out of 33 places after structural reductions.
[2023-03-12 22:58:43] [INFO ] Flatten gal took : 16 ms
[2023-03-12 22:58:43] [INFO ] Flatten gal took : 5 ms
[2023-03-12 22:58:43] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 12008 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=522 ) properties (out of 19) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:43] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-12 22:58:43] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(p0))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
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 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
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 15 place count 24 transition count 15
Applied a total of 15 rules in 16 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2023-03-12 22:58:43] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:58:43] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
// Phase 1: matrix 15 rows 24 cols
[2023-03-12 22:58:43] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:58:43] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 15 rows 24 cols
[2023-03-12 22:58:43] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:58:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 22:58:43] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [0, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 109 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/33 places, 15/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 17 transition count 12
Applied a total of 6 rules in 3 ms. Remains 17 /20 variables (removed 3) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 17 cols
[2023-03-12 22:58:43] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:58:43] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2023-03-12 22:58:43] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:58:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 22:58:43] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/33 places, 12/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 228 ms. Remains : 17/33 places, 12/22 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s14 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 5 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLFireability-01 finished in 430 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' '!((p0 U X((F(p1)&&G(p0)))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:44] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:58:44] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:44] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:58:44] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:44] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:58:44] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 98 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141 ms. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 0}, { cond=(NOT p0), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p0:(GEQ s14 1), p1:(OR (AND (GEQ s1 1) (GEQ s12 1)) (AND (GEQ s1 7000) (GEQ s22 7000)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLFireability-05 finished in 423 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)&&F((p1||G((p2 U X(X(!p0))))))))'
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:44] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-12 22:58:44] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:44] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:58:44] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:44] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:58:44] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 95 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 6}, { cond=(NOT p1), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=6 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=7 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s8 1)), p2:(AND (GEQ s2 2) (GEQ s13 1) (GEQ s25 1)), p0:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s28 7000))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 1 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLFireability-06 finished in 541 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 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
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 4 place count 31 transition count 20
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Applied a total of 10 rules in 10 ms. Remains 27 /33 variables (removed 6) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 27 cols
[2023-03-12 22:58:45] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:58:45] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
// Phase 1: matrix 18 rows 27 cols
[2023-03-12 22:58:45] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:58:45] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 18 rows 27 cols
[2023-03-12 22:58:45] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:58:45] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [3, 15]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 82 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/33 places, 18/22 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 23 transition count 16
Applied a total of 4 rules in 3 ms. Remains 23 /25 variables (removed 2) and now considering 16/18 (removed 2) transitions.
// Phase 1: matrix 16 rows 23 cols
[2023-03-12 22:58:45] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:58:45] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2023-03-12 22:58:45] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:58:45] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/33 places, 16/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 187 ms. Remains : 23/33 places, 16/22 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLFireability-08 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:(OR (LT s0 1) (LT s2 1) (LT s7 1) (LT s22 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]]
Product exploration explored 100000 steps with 2351 reset in 250 ms.
Stack based approach found an accepted trace after 263 steps with 5 reset with depth 77 and stack size 65 in 1 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLFireability-08 finished in 537 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((F(p0)||G(p1)))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:45] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:58:45] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:45] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-12 22:58:45] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:45] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:58:45] [INFO ] Implicit Places using invariants and state equation in 47 ms returned [2, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 87 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s14 1) (GEQ s25 3000)), p1:(OR (LT s2 1) (LT s21 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 33333 reset in 129 ms.
Product exploration explored 100000 steps with 33333 reset in 122 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 (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1)
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C1000N0000001000-LTLFireability-09 finished in 688 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)&&F(G(p1)))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 3 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 8 place count 28 transition count 18
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 26 transition count 17
Applied a total of 11 rules in 6 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:58:46] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:58:46] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:58:46] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:58:46] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:58:46] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:58:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 22:58:46] [INFO ] Implicit Places using invariants and state equation in 44 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 74 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/33 places, 17/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 16
Applied a total of 2 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 23 cols
[2023-03-12 22:58:46] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:58:46] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2023-03-12 22:58:46] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:58:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 22:58:46] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/33 places, 16/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 174 ms. Remains : 23/33 places, 16/22 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLFireability-11 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 s1 1) (GEQ s16 1)), p1:(AND (GEQ s11 1) (GEQ s13 1) (OR (LT s10 1) (LT s11 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 5 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLFireability-11 finished in 358 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 X(G((p1&&X(p1))))))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:46] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-12 22:58:46] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:46] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:58:46] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:46] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:58:46] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 96 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 168 ms. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}]], initial=1, aps=[p0:(LT s21 1), p1:(GEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2624 reset in 150 ms.
Stack based approach found an accepted trace after 11 steps with 1 reset with depth 10 and stack size 10 in 0 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLFireability-12 finished in 488 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(G(p0)))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:47] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:58:47] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:47] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:58:47] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:58:47] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:58:47] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 80 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-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: 2}]], initial=1, aps=[p0:(LT s17 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 34 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLFireability-14 finished in 219 ms.
All properties solved by simple procedures.
Total runtime 5174 ms.
ITS solved all properties within timeout

BK_STOP 1678661928313

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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="GPPP-PT-C1000N0000001000"
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 GPPP-PT-C1000N0000001000, 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 r169-tall-167838856600900"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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