Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r136-tall-171631132900542.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DoubleExponent-PT-003, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132900542
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 12 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 50K May 18 16:42 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 DoubleExponent-PT-003-ReachabilityCardinality-2024-00
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-01
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-02
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-03
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-04
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-05
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-06
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-07
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-08
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-09
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-10
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-11
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-12
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-13
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-14
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716385573209

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-22 13:46:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 13:46:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:46:14] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2024-05-22 13:46:14] [INFO ] Transformed 163 places.
[2024-05-22 13:46:14] [INFO ] Transformed 148 transitions.
[2024-05-22 13:46:14] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
[2024-05-22 13:46:15] [INFO ] Flatten gal took : 93 ms
[2024-05-22 13:46:15] [INFO ] Flatten gal took : 36 ms
RANDOM walk for 40000 steps (1308 resets) in 1645 ms. (24 steps per ms) remains 16/16 properties
[2024-05-22 13:46:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8692596902946632886.gal : 55 ms
BEST_FIRST walk for 4001 steps (116 resets) in 269 ms. (14 steps per ms) remains 16/16 properties
[2024-05-22 13:46:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11497358629194044742.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8692596902946632886.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11497358629194044742.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality11497358629194044742.prop.
BEST_FIRST walk for 4001 steps (105 resets) in 289 ms. (13 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :7 after 11
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :12 after 25
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :25 after 32
BEST_FIRST walk for 4000 steps (111 resets) in 257 ms. (15 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :32 after 73
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :73 after 149
BEST_FIRST walk for 4001 steps (114 resets) in 122 ms. (32 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (114 resets) in 114 ms. (34 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (108 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :149 after 517
BEST_FIRST walk for 4001 steps (112 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (110 resets) in 92 ms. (43 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (111 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (117 resets) in 56 ms. (70 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (112 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (115 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (118 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (109 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (112 resets) in 63 ms. (62 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 2048
BEST_FIRST walk for 4000 steps (113 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
SDD size :517 after 2692
Reachability property DoubleExponent-PT-003-ReachabilityCardinality-2024-11 is true.
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property DoubleExponent-PT-003-ReachabilityCardinality-2024-02 does not hold.
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Interrupted probabilistic random walk after 197494 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :3 out of 16
Probabilistic random walk after 197494 steps, saw 98761 distinct states, run finished after 3012 ms. (steps per millisecond=65 ) properties seen :3
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Reachability property DoubleExponent-PT-003-ReachabilityCardinality-2024-00 is true.
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :48682 after 59745
// Phase 1: matrix 148 rows 163 cols
[2024-05-22 13:46:18] [INFO ] Computed 19 invariants in 27 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-01 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-04 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-05 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-06 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-10 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 9/162 variables, 5/12 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 4/16 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 5 solved, 8 unsolved
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-03 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-13 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 1/163 variables, 3/19 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 148/311 variables, 163/182 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/182 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/311 variables, 0/182 constraints. Problems are: Problem set: 7 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 182 constraints, problems are : Problem set: 7 solved, 6 unsolved in 1219 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 6 unsolved
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-09 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-15 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 24/156 variables, 5/6 constraints. Problems are: Problem set: 9 solved, 4 unsolved
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-07 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-08 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 6/12 constraints. Problems are: Problem set: 11 solved, 2 unsolved
[2024-05-22 13:46:20] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 23 ms to minimize.
[2024-05-22 13:46:20] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/14 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/14 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/163 variables, 7/21 constraints. Problems are: Problem set: 11 solved, 2 unsolved
[2024-05-22 13:46:20] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 0 ms to minimize.
[2024-05-22 13:46:20] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:46:20] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:46:20] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 4/25 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/25 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 148/311 variables, 163/188 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 2/190 constraints. Problems are: Problem set: 11 solved, 2 unsolved
[2024-05-22 13:46:21] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-22 13:46:21] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 2/192 constraints. Problems are: Problem set: 11 solved, 2 unsolved
[2024-05-22 13:46:21] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 1/193 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 0/193 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/311 variables, 0/193 constraints. Problems are: Problem set: 11 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 193 constraints, problems are : Problem set: 11 solved, 2 unsolved in 1314 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 2/13 constraints, Known Traps: 9/9 constraints]
After SMT, in 2745ms problems are : Problem set: 11 solved, 2 unsolved
Parikh walk visited 0 properties in 887 ms.
Support contains 24 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 148/148 transitions.
Graph (complete) has 269 edges and 163 vertex of which 160 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 159 transition count 129
Reduce places removed 18 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 141 transition count 125
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 47 place count 137 transition count 125
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 47 place count 137 transition count 119
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 59 place count 131 transition count 119
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 89 place count 116 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 115 transition count 104
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 115 transition count 101
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 97 place count 112 transition count 101
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 106 place count 112 transition count 92
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 115 place count 103 transition count 92
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 125 place count 103 transition count 92
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 127 place count 103 transition count 92
Applied a total of 127 rules in 85 ms. Remains 103 /163 variables (removed 60) and now considering 92/148 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 103/163 places, 92/148 transitions.
RANDOM walk for 40000 steps (1644 resets) in 442 ms. (90 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (1356 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1411 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 549146 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 2
Probabilistic random walk after 549146 steps, saw 274666 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
// Phase 1: matrix 92 rows 103 cols
[2024-05-22 13:46:25] [INFO ] Computed 16 invariants in 3 ms
[2024-05-22 13:46:25] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/90 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/96 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 92/188 variables, 96/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/195 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/195 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 103/103 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Reachability property DoubleExponent-PT-003-ReachabilityCardinality-2024-12 is true.
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/34 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 13:46:26] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 56/90 variables, 13/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/96 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/188 variables, 96/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 4/117 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/195 variables, 7/124 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 1/125 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 13:46:26] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 1/126 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/195 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/195 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 126 constraints, problems are : Problem set: 1 solved, 1 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 103/103 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 381ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 92/92 transitions.
Graph (complete) has 254 edges and 103 vertex of which 100 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 100 transition count 87
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 96 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 95 transition count 86
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 12 place count 95 transition count 82
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 20 place count 91 transition count 82
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 38 place count 82 transition count 73
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 44 place count 79 transition count 73
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 52 place count 79 transition count 65
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 60 place count 71 transition count 65
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 63 place count 71 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 70 transition count 64
Applied a total of 64 rules in 23 ms. Remains 70 /103 variables (removed 33) and now considering 64/92 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 70/103 places, 64/92 transitions.
RANDOM walk for 40000 steps (3072 resets) in 624 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 335 ms. (119 steps per ms) remains 1/1 properties
Probably explored full state space saw : 766840 states, properties seen :0
Probabilistic random walk after 1533714 steps, saw 766840 distinct states, run finished after 2796 ms. (steps per millisecond=548 ) properties seen :0
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :318071 after 329127
Interrupted probabilistic random walk after 1643578 steps, run timeout after 3001 ms. (steps per millisecond=547 ) properties seen :0 out of 1
Exhaustive walk after 1643578 steps, saw 821888 distinct states, run finished after 3001 ms. (steps per millisecond=547 ) properties seen :0
// Phase 1: matrix 64 rows 70 cols
[2024-05-22 13:46:32] [INFO ] Computed 15 invariants in 20 ms
[2024-05-22 13:46:32] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/57 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/70 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 64/134 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 14/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/134 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 70/70 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/57 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 13:46:32] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-22 13:46:32] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-22 13:46:32] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-22 13:46:32] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-22 13:46:32] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/70 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 64/134 variables, 70/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 14/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/134 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/134 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 105 constraints, problems are : Problem set: 0 solved, 1 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 70/70 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 403ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 70 /70 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 70/70 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 70 /70 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-22 13:46:32] [INFO ] Invariant cache hit.
[2024-05-22 13:46:32] [INFO ] Implicit Places using invariants in 89 ms returned [14, 20, 36, 41, 61, 67]
[2024-05-22 13:46:32] [INFO ] Actually due to overlaps returned [41, 36]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 97 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 68/70 places, 64/64 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 63
Applied a total of 2 rules in 6 ms. Remains 67 /68 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 67 cols
[2024-05-22 13:46:32] [INFO ] Computed 13 invariants in 2 ms
[2024-05-22 13:46:33] [INFO ] Implicit Places using invariants in 67 ms returned [14, 20, 58, 64]
[2024-05-22 13:46:33] [INFO ] Actually due to overlaps returned [14, 58]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 65/70 places, 63/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 61
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 64 transition count 61
Applied a total of 3 rules in 7 ms. Remains 64 /65 variables (removed 1) and now considering 61/63 (removed 2) transitions.
// Phase 1: matrix 61 rows 64 cols
[2024-05-22 13:46:33] [INFO ] Computed 11 invariants in 2 ms
[2024-05-22 13:46:33] [INFO ] Implicit Places using invariants in 62 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 63/70 places, 61/64 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 60
Applied a total of 2 rules in 5 ms. Remains 62 /63 variables (removed 1) and now considering 60/61 (removed 1) transitions.
// Phase 1: matrix 60 rows 62 cols
[2024-05-22 13:46:33] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 13:46:33] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 13:46:33] [INFO ] Invariant cache hit.
[2024-05-22 13:46:33] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 13:46:33] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 62/70 places, 60/64 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 393 ms. Remains : 62/70 places, 60/64 transitions.
RANDOM walk for 40000 steps (3430 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (2664 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Probably explored full state space saw : 748436 states, properties seen :0
Probabilistic random walk after 1496917 steps, saw 748436 distinct states, run finished after 2415 ms. (steps per millisecond=619 ) properties seen :0
Explored full state space saw : 751552 states, properties seen :0
Exhaustive walk after 1503103 steps, saw 751552 distinct states, run finished after 2309 ms. (steps per millisecond=650 ) properties seen :0
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 23676 ms.

BK_STOP 1716385598064

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-003"
export BK_EXAMINATION="ReachabilityCardinality"
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-5568"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-003, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631132900542"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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