Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r039-tajo-167813692400370.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is BugTracking-PT-q3m128, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692400370
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.0K Feb 26 07:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 07:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 06:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 06:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 07:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 07:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 07:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 07:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q3m128-CTLFireability-00
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-01
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-02
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-03
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-04
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-05
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-06
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-07
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-08
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-09
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-10
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-11
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-12
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-13
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-14
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678494903088

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=lolaxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m128
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 00:35:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 00:35:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:35:05] [INFO ] Load time of PNML (sax parser for PT used): 586 ms
[2023-03-11 00:35:05] [INFO ] Transformed 754 places.
[2023-03-11 00:35:05] [INFO ] Transformed 27370 transitions.
[2023-03-11 00:35:05] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 750 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Deduced a syphon composed of 514 places in 104 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m128-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 78 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2023-03-11 00:35:06] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-11 00:35:06] [INFO ] Computed 8 place invariants in 43 ms
[2023-03-11 00:35:06] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-03-11 00:35:06] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-11 00:35:06] [INFO ] Invariant cache hit.
[2023-03-11 00:35:06] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-11 00:35:07] [INFO ] Implicit Places using invariants and state equation in 1370 ms returned []
Implicit Place search using SMT with State Equation took 1912 ms to find 0 implicit places.
[2023-03-11 00:35:07] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-11 00:35:07] [INFO ] Invariant cache hit.
[2023-03-11 00:35:08] [INFO ] Dead Transitions using invariants and state equation in 902 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2750/2769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2899 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 13 out of 237 places after structural reductions.
[2023-03-11 00:35:09] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2023-03-11 00:35:09] [INFO ] Flatten gal took : 378 ms
[2023-03-11 00:35:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q3m128-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 00:35:09] [INFO ] Flatten gal took : 315 ms
[2023-03-11 00:35:10] [INFO ] Input system was already deterministic with 2750 transitions.
Support contains 11 out of 237 places (down from 13) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 152591 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152591 steps, saw 73695 distinct states, run finished after 3003 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 00:35:14] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-11 00:35:14] [INFO ] Invariant cache hit.
[2023-03-11 00:35:14] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 00:35:15] [INFO ] After 815ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 00:35:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-11 00:35:16] [INFO ] After 992ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 00:35:16] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-11 00:35:16] [INFO ] After 422ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 00:35:17] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 5 ms to minimize.
[2023-03-11 00:35:17] [INFO ] Deduced a trap composed of 20 places in 204 ms of which 1 ms to minimize.
[2023-03-11 00:35:17] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2023-03-11 00:35:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 822 ms
[2023-03-11 00:35:18] [INFO ] Deduced a trap composed of 16 places in 364 ms of which 1 ms to minimize.
[2023-03-11 00:35:18] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 2 ms to minimize.
[2023-03-11 00:35:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 724 ms
[2023-03-11 00:35:18] [INFO ] After 2304ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-11 00:35:18] [INFO ] After 3581ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 6 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 235 transition count 2748
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 230 transition count 2748
Applied a total of 14 rules in 151 ms. Remains 230 /237 variables (removed 7) and now considering 2748/2750 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 230/237 places, 2748/2750 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 153470 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153470 steps, saw 100892 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 00:35:22] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2023-03-11 00:35:22] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-11 00:35:22] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:35:22] [INFO ] After 600ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 00:35:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 00:35:23] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 00:35:23] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:35:23] [INFO ] After 251ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 00:35:23] [INFO ] Deduced a trap composed of 18 places in 312 ms of which 0 ms to minimize.
[2023-03-11 00:35:24] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 1 ms to minimize.
[2023-03-11 00:35:24] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 1 ms to minimize.
[2023-03-11 00:35:24] [INFO ] Deduced a trap composed of 40 places in 256 ms of which 0 ms to minimize.
[2023-03-11 00:35:25] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 1 ms to minimize.
[2023-03-11 00:35:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1434 ms
[2023-03-11 00:35:25] [INFO ] After 1853ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-11 00:35:25] [INFO ] After 2435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 46 ms.
Support contains 6 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 40 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 230/230 places, 2748/2748 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 37 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
[2023-03-11 00:35:25] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-11 00:35:25] [INFO ] Invariant cache hit.
[2023-03-11 00:35:26] [INFO ] Implicit Places using invariants in 587 ms returned []
[2023-03-11 00:35:26] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-11 00:35:26] [INFO ] Invariant cache hit.
[2023-03-11 00:35:26] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:35:27] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 1783 ms to find 0 implicit places.
[2023-03-11 00:35:27] [INFO ] Redundant transitions in 209 ms returned []
[2023-03-11 00:35:27] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-11 00:35:27] [INFO ] Invariant cache hit.
[2023-03-11 00:35:28] [INFO ] Dead Transitions using invariants and state equation in 981 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3016 ms. Remains : 230/230 places, 2748/2748 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 230 transition count 2618
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 229 transition count 2617
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 229 transition count 2616
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 229 transition count 2611
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 143 place count 224 transition count 2611
Applied a total of 143 rules in 151 ms. Remains 224 /230 variables (removed 6) and now considering 2611/2748 (removed 137) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2611 rows 224 cols
[2023-03-11 00:35:28] [INFO ] Computed 9 place invariants in 41 ms
[2023-03-11 00:35:28] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 00:35:29] [INFO ] After 757ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 00:35:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 00:35:30] [INFO ] After 544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 00:35:30] [INFO ] After 783ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-11 00:35:30] [INFO ] After 1010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2023-03-11 00:35:30] [INFO ] Flatten gal took : 131 ms
[2023-03-11 00:35:30] [INFO ] Flatten gal took : 136 ms
[2023-03-11 00:35:31] [INFO ] Input system was already deterministic with 2750 transitions.
Support contains 3 out of 237 places (down from 6) after GAL structural reductions.
Computed a total of 6 stabilizing places and 111 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 65 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-11 00:35:31] [INFO ] Flatten gal took : 88 ms
[2023-03-11 00:35:31] [INFO ] Flatten gal took : 102 ms
[2023-03-11 00:35:31] [INFO ] Input system was already deterministic with 2750 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 206000 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206000 steps, saw 99979 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 00:35:34] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-11 00:35:34] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-11 00:35:34] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 00:35:35] [INFO ] After 536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:35:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 00:35:35] [INFO ] After 475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:35:35] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-11 00:35:36] [INFO ] After 237ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 00:35:36] [INFO ] Deduced a trap composed of 12 places in 289 ms of which 1 ms to minimize.
[2023-03-11 00:35:36] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 1 ms to minimize.
[2023-03-11 00:35:37] [INFO ] Deduced a trap composed of 11 places in 296 ms of which 1 ms to minimize.
[2023-03-11 00:35:37] [INFO ] Deduced a trap composed of 53 places in 282 ms of which 1 ms to minimize.
[2023-03-11 00:35:37] [INFO ] Deduced a trap composed of 50 places in 283 ms of which 0 ms to minimize.
[2023-03-11 00:35:38] [INFO ] Deduced a trap composed of 30 places in 284 ms of which 1 ms to minimize.
[2023-03-11 00:35:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2029 ms
[2023-03-11 00:35:38] [INFO ] After 2343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-11 00:35:38] [INFO ] After 3011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1067 ms.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 235 transition count 2748
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 230 transition count 2748
Applied a total of 14 rules in 129 ms. Remains 230 /237 variables (removed 7) and now considering 2748/2750 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 230/237 places, 2748/2750 transitions.
Incomplete random walk after 1000000 steps, including 634 resets, run finished after 4510 ms. (steps per millisecond=221 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 107 resets, run finished after 1564 ms. (steps per millisecond=639 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1316198 steps, run timeout after 18001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 1316198 steps, saw 855375 distinct states, run finished after 18001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 00:36:03] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2023-03-11 00:36:03] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-11 00:36:03] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 00:36:04] [INFO ] After 656ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:36:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-11 00:36:04] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:36:04] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:36:04] [INFO ] After 155ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 00:36:05] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 0 ms to minimize.
[2023-03-11 00:36:05] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 1 ms to minimize.
[2023-03-11 00:36:05] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 0 ms to minimize.
[2023-03-11 00:36:05] [INFO ] Deduced a trap composed of 30 places in 263 ms of which 0 ms to minimize.
[2023-03-11 00:36:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1069 ms
[2023-03-11 00:36:05] [INFO ] After 1285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-11 00:36:06] [INFO ] After 1775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1593 ms.
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 31 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 230/230 places, 2748/2748 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 30 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
[2023-03-11 00:36:07] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-11 00:36:07] [INFO ] Invariant cache hit.
[2023-03-11 00:36:08] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-11 00:36:08] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-11 00:36:08] [INFO ] Invariant cache hit.
[2023-03-11 00:36:08] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:36:09] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 1869 ms to find 0 implicit places.
[2023-03-11 00:36:09] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-11 00:36:09] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-11 00:36:09] [INFO ] Invariant cache hit.
[2023-03-11 00:36:10] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2839 ms. Remains : 230/230 places, 2748/2748 transitions.
Incomplete random walk after 100000 steps, including 61 resets, run finished after 712 ms. (steps per millisecond=140 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-11 00:36:11] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-11 00:36:11] [INFO ] Invariant cache hit.
[2023-03-11 00:36:11] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-11 00:36:11] [INFO ] After 404ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 00:36:11] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:36:11] [INFO ] After 239ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-03-11 00:36:12] [INFO ] Deduced a trap composed of 28 places in 206 ms of which 1 ms to minimize.
[2023-03-11 00:36:12] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 0 ms to minimize.
[2023-03-11 00:36:12] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 0 ms to minimize.
[2023-03-11 00:36:12] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 0 ms to minimize.
[2023-03-11 00:36:13] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 1 ms to minimize.
[2023-03-11 00:36:13] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 0 ms to minimize.
[2023-03-11 00:36:13] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 0 ms to minimize.
[2023-03-11 00:36:13] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 0 ms to minimize.
[2023-03-11 00:36:13] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 1 ms to minimize.
[2023-03-11 00:36:14] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 13 ms to minimize.
[2023-03-11 00:36:14] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 0 ms to minimize.
[2023-03-11 00:36:14] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 0 ms to minimize.
[2023-03-11 00:36:14] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 0 ms to minimize.
[2023-03-11 00:36:14] [INFO ] Deduced a trap composed of 50 places in 192 ms of which 1 ms to minimize.
[2023-03-11 00:36:15] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 5 ms to minimize.
[2023-03-11 00:36:15] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 0 ms to minimize.
[2023-03-11 00:36:15] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 0 ms to minimize.
[2023-03-11 00:36:15] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 0 ms to minimize.
[2023-03-11 00:36:15] [INFO ] Deduced a trap composed of 53 places in 200 ms of which 0 ms to minimize.
[2023-03-11 00:36:16] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 1 ms to minimize.
[2023-03-11 00:36:16] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 1 ms to minimize.
[2023-03-11 00:36:16] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 0 ms to minimize.
[2023-03-11 00:36:16] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 0 ms to minimize.
[2023-03-11 00:36:16] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 0 ms to minimize.
[2023-03-11 00:36:16] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 1 ms to minimize.
[2023-03-11 00:36:17] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 1 ms to minimize.
[2023-03-11 00:36:17] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 0 ms to minimize.
[2023-03-11 00:36:17] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 0 ms to minimize.
[2023-03-11 00:36:17] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 1 ms to minimize.
[2023-03-11 00:36:18] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 0 ms to minimize.
[2023-03-11 00:36:18] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 3 ms to minimize.
[2023-03-11 00:36:18] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 1 ms to minimize.
[2023-03-11 00:36:18] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 1 ms to minimize.
[2023-03-11 00:36:18] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 0 ms to minimize.
[2023-03-11 00:36:19] [INFO ] Deduced a trap composed of 46 places in 188 ms of which 0 ms to minimize.
[2023-03-11 00:36:19] [INFO ] Deduced a trap composed of 47 places in 205 ms of which 0 ms to minimize.
[2023-03-11 00:36:19] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 1 ms to minimize.
[2023-03-11 00:36:19] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 0 ms to minimize.
[2023-03-11 00:36:20] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 2 ms to minimize.
[2023-03-11 00:36:20] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 0 ms to minimize.
[2023-03-11 00:36:20] [INFO ] Deduced a trap composed of 48 places in 186 ms of which 1 ms to minimize.
[2023-03-11 00:36:20] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 1 ms to minimize.
[2023-03-11 00:36:21] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 1 ms to minimize.
[2023-03-11 00:36:21] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 0 ms to minimize.
[2023-03-11 00:36:21] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 1 ms to minimize.
[2023-03-11 00:36:21] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 0 ms to minimize.
[2023-03-11 00:36:22] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 0 ms to minimize.
[2023-03-11 00:36:22] [INFO ] Deduced a trap composed of 48 places in 216 ms of which 1 ms to minimize.
[2023-03-11 00:36:22] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 1 ms to minimize.
[2023-03-11 00:36:22] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 10894 ms
[2023-03-11 00:36:22] [INFO ] After 11212ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-11 00:36:22] [INFO ] After 11685ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-11 00:36:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 00:36:23] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 00:36:23] [INFO ] After 114ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-11 00:36:23] [INFO ] Deduced a trap composed of 49 places in 276 ms of which 0 ms to minimize.
[2023-03-11 00:36:24] [INFO ] Deduced a trap composed of 16 places in 250 ms of which 0 ms to minimize.
[2023-03-11 00:36:24] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 0 ms to minimize.
[2023-03-11 00:36:24] [INFO ] Deduced a trap composed of 49 places in 243 ms of which 1 ms to minimize.
[2023-03-11 00:36:25] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 0 ms to minimize.
[2023-03-11 00:36:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1681 ms
[2023-03-11 00:36:25] [INFO ] After 1830ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-11 00:36:25] [INFO ] After 2302ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
FORMULA BugTracking-PT-q3m128-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 21 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-11 00:36:25] [INFO ] Flatten gal took : 139 ms
[2023-03-11 00:36:25] [INFO ] Flatten gal took : 126 ms
[2023-03-11 00:36:25] [INFO ] Input system was already deterministic with 2750 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 10 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-11 00:36:26] [INFO ] Flatten gal took : 117 ms
[2023-03-11 00:36:26] [INFO ] Flatten gal took : 118 ms
[2023-03-11 00:36:26] [INFO ] Input system was already deterministic with 2750 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 8 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-11 00:36:26] [INFO ] Flatten gal took : 88 ms
[2023-03-11 00:36:26] [INFO ] Flatten gal took : 97 ms
[2023-03-11 00:36:26] [INFO ] Input system was already deterministic with 2750 transitions.
[2023-03-11 00:36:26] [INFO ] Flatten gal took : 101 ms
[2023-03-11 00:36:27] [INFO ] Flatten gal took : 108 ms
[2023-03-11 00:36:27] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-11 00:36:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 237 places, 2750 transitions and 13477 arcs took 17 ms.
Total runtime 82154 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BugTracking-PT-q3m128
BK_EXAMINATION: CTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
CTLFireability

FORMULA BugTracking-PT-q3m128-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BugTracking-PT-q3m128-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BugTracking-PT-q3m128-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678494987688

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/CTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:138
lola: rewrite Frontend/Parser/formula_rewrite.k:199
lola: rewrite Frontend/Parser/formula_rewrite.k:150
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:129
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:138
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH INITIAL
lola: LAUNCH task # 4 (type CNST) for 3 BugTracking-PT-q3m128-CTLFireability-10
lola: time limit : 0 sec
lola: memory limit: 0 pages
lola: FINISHED task # 4 (type CNST) for BugTracking-PT-q3m128-CTLFireability-10
lola: result : true
lola: LAUNCH INITIAL
lola: LAUNCH task # 7 (type CNST) for 6 BugTracking-PT-q3m128-CTLFireability-11
lola: time limit : 0 sec
lola: memory limit: 0 pages
lola: FINISHED task # 7 (type CNST) for BugTracking-PT-q3m128-CTLFireability-11
lola: result : false
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:776
lola: LAUNCH task # 9 (type EXCL) for 0 BugTracking-PT-q3m128-CTLFireability-03
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 9 (type EXCL) for BugTracking-PT-q3m128-CTLFireability-03
lola: result : true
lola: markings : 146
lola: fired transitions : 146
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BugTracking-PT-q3m128-CTLFireability-03: F false state space / EG
BugTracking-PT-q3m128-CTLFireability-10: INITIAL true preprocessing
BugTracking-PT-q3m128-CTLFireability-11: INITIAL false preprocessing


Time elapsed: 0 secs. Pages in use: 1

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="BugTracking-PT-q3m128"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is BugTracking-PT-q3m128, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692400370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m128.tgz
mv BugTracking-PT-q3m128 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;