Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r096-smll-165260576000284.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPPP-PT-C1000N0000000100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260576000284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 7.1K Apr 29 18:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 18:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 18:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 29 18:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 17 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1 May 10 09:34 large_marking
-rw-r--r-- 1 mcc users 21K May 10 09:34 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-C1000N0000000100-LTLFireability-00
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-01
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-02
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-03
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-04
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-05
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-06
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-07
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-08
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-09
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-10
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-11
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-12
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-13
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-14
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652712101595

Running Version 202205111006
[2022-05-16 14:41:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 14:41:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 14:41:44] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2022-05-16 14:41:44] [INFO ] Transformed 33 places.
[2022-05-16 14:41:44] [INFO ] Transformed 22 transitions.
[2022-05-16 14:41:44] [INFO ] Parsed PT model containing 33 places and 22 transitions in 254 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 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 15 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 14:41:44] [INFO ] Invariants computation overflowed in 15 ms
[2022-05-16 14:41:44] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 14:41:44] [INFO ] Invariants computation overflowed in 13 ms
[2022-05-16 14:41:44] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 14:41:44] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-16 14:41:44] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 199 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 22/22 transitions.
Support contains 19 out of 32 places after structural reductions.
[2022-05-16 14:41:45] [INFO ] Flatten gal took : 30 ms
[2022-05-16 14:41:45] [INFO ] Flatten gal took : 12 ms
[2022-05-16 14:41:45] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10012 steps, including 3 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 32 cols
[2022-05-16 14:41:45] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-16 14:41:45] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(X(F(p0))))&&G(p1)&&F(p2)))))'
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2022-05-16 14:41:45] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 14:41:45] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
// Phase 1: matrix 22 rows 32 cols
[2022-05-16 14:41:45] [INFO ] Invariants computation overflowed in 7 ms
[2022-05-16 14:41:46] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2022-05-16 14:41:46] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 14:41:46] [INFO ] Implicit Places using invariants and state equation in 78 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 166 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/32 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 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 525 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p2), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(OR (LT s2 1) (LT s21 1)), p2:(LT s16 1), p0:(AND (GEQ s1 1) (GEQ s13 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, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 154 steps with 2 reset in 16 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-02 finished in 846 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2022-05-16 14:41:46] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 14:41:46] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
// Phase 1: matrix 22 rows 32 cols
[2022-05-16 14:41:46] [INFO ] Invariants computation overflowed in 4 ms
[2022-05-16 14:41:46] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2022-05-16 14:41:46] [INFO ] Invariants computation overflowed in 3 ms
[2022-05-16 14:41:46] [INFO ] Implicit Places using invariants and state equation in 144 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 209 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/32 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 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-05 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:(OR (LT s2 1) (LT s21 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 55 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-05 finished in 433 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G(X(F(p0)))))&&X(p1)))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2022-05-16 14:41:47] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-16 14:41:47] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
// Phase 1: matrix 22 rows 32 cols
[2022-05-16 14:41:47] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 14:41:47] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2022-05-16 14:41:47] [INFO ] Invariants computation overflowed in 3 ms
[2022-05-16 14:41:47] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 217 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 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 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s14 1), p0:(GEQ s10 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-06 finished in 501 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 5 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 31 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 30 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 30 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 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 27 transition count 17
Applied a total of 9 rules in 26 ms. Remains 27 /32 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 27 cols
[2022-05-16 14:41:47] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 14:41:47] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
// Phase 1: matrix 17 rows 27 cols
[2022-05-16 14:41:47] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 14:41:47] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 17 rows 27 cols
[2022-05-16 14:41:47] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 14:41:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 14:41:47] [INFO ] Implicit Places using invariants and state equation in 136 ms returned [0, 2, 16, 20]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 209 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/32 places, 17/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 20 transition count 14
Applied a total of 6 rules in 6 ms. Remains 20 /23 variables (removed 3) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 20 cols
[2022-05-16 14:41:47] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-16 14:41:47] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2022-05-16 14:41:47] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 14:41:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 14:41:48] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/32 places, 14/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 20/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s4 2)], 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 16 steps with 1 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-08 finished in 482 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 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.
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 31 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 30 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 30 transition count 19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 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 26 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 24 transition count 16
Applied a total of 13 rules in 17 ms. Remains 24 /32 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 24 cols
[2022-05-16 14:41:48] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-16 14:41:48] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
// Phase 1: matrix 16 rows 24 cols
[2022-05-16 14:41:48] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 14:41:48] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 16 rows 24 cols
[2022-05-16 14:41:48] [INFO ] Invariants computation overflowed in 3 ms
[2022-05-16 14:41:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 14:41:48] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [2, 12]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 170 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 16/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 19 transition count 13
Applied a total of 6 rules in 5 ms. Remains 19 /22 variables (removed 3) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 19 cols
[2022-05-16 14:41:48] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 14:41:48] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 13 rows 19 cols
[2022-05-16 14:41:48] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 14:41:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 14:41:48] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/32 places, 13/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 19/32 places, 13/22 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s10 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]]
Product exploration explored 100000 steps with 50000 reset in 489 ms.
Product exploration explored 100000 steps with 50000 reset in 304 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 : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-12 finished in 1337 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((X(G((!p0 U p1)))||!p0)))&&p2)))'
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 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 32 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 31 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 31 transition count 20
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 30 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 28 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 26 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 25 transition count 17
Applied a total of 12 rules in 19 ms. Remains 25 /32 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 25 cols
[2022-05-16 14:41:49] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 14:41:49] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
// Phase 1: matrix 17 rows 25 cols
[2022-05-16 14:41:49] [INFO ] Invariants computation overflowed in 7 ms
[2022-05-16 14:41:49] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2022-05-16 14:41:49] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 14:41:49] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [0, 14, 18]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 139 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 17/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 22/32 places, 17/22 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (AND (NOT p1) p0), (NOT p2), (AND (NOT p1) p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (GEQ s11 1) (AND (GEQ s1 1) (GEQ s14 1))), p1:(AND (GEQ s0 1) (GEQ s8 1)), p0:(OR (LT s1 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2679 reset in 377 ms.
Stack based approach found an accepted trace after 69 steps with 1 reset with depth 29 and stack size 29 in 1 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-13 finished in 783 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X((F(p1)&&p0))))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 3 edges and 32 vertex of which 2 / 32 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 31 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 30 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 27 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 25 transition count 17
Applied a total of 11 rules in 8 ms. Remains 25 /32 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 25 cols
[2022-05-16 14:41:50] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 14:41:50] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
// Phase 1: matrix 17 rows 25 cols
[2022-05-16 14:41:50] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 14:41:50] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2022-05-16 14:41:50] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-16 14:41:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 14:41:50] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 153 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/32 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 3 ms. Remains 23 /24 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 23 cols
[2022-05-16 14:41:50] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 14:41:50] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2022-05-16 14:41:50] [INFO ] Invariants computation overflowed in 3 ms
[2022-05-16 14:41:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 14:41:50] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/32 places, 16/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 23/32 places, 16/22 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s20 1)), p1:(OR (LT s11 1) (LT s13 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 7 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-14 finished in 467 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U F(X(X(G(p0)))))||F(G(F(p1)))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 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.
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 31 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 30 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 30 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 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 27 transition count 17
Applied a total of 9 rules in 7 ms. Remains 27 /32 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 27 cols
[2022-05-16 14:41:50] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 14:41:50] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
// Phase 1: matrix 17 rows 27 cols
[2022-05-16 14:41:50] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 14:41:50] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 17 rows 27 cols
[2022-05-16 14:41:50] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 14:41:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 14:41:50] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [0, 2, 16, 20]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 143 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/32 places, 17/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 20 transition count 14
Applied a total of 6 rules in 4 ms. Remains 20 /23 variables (removed 3) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 20 cols
[2022-05-16 14:41:50] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 14:41:50] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2022-05-16 14:41:50] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-16 14:41:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 14:41:50] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/32 places, 14/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 20/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s17 1)), p1:(LT s4 2)], 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 38 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-15 finished in 381 ms.
All properties solved by simple procedures.
Total runtime 7120 ms.

BK_STOP 1652712111166

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-C1000N0000000100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C1000N0000000100, 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 r096-smll-165260576000284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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