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.r356-tall-171683762300990.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 ShieldRVt-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762300990
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 21:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 21:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 21:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 21:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 239K May 18 16:43 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 ShieldRVt-PT-020B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717079825148

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-30 14:37:06] [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-30 14:37:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 14:37:06] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-05-30 14:37:06] [INFO ] Transformed 1003 places.
[2024-05-30 14:37:06] [INFO ] Transformed 1003 transitions.
[2024-05-30 14:37:06] [INFO ] Found NUPN structural information;
[2024-05-30 14:37:06] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1601 ms. (24 steps per ms) remains 6/15 properties
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 423 ms. (94 steps per ms) remains 6/6 properties
[2024-05-30 14:37:07] [INFO ] Flatten gal took : 196 ms
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
[2024-05-30 14:37:07] [INFO ] Flatten gal took : 83 ms
[2024-05-30 14:37:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8675541416412970390.gal : 59 ms
BEST_FIRST walk for 40004 steps (8 resets) in 429 ms. (93 steps per ms) remains 6/6 properties
[2024-05-30 14:37:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6330712720847248212.prop : 3 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/ReachabilityCardinality8675541416412970390.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6330712720847248212.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 6/6 properties

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 ...328
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality6330712720847248212.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 490 ms. (81 steps per ms) remains 6/6 properties
// Phase 1: matrix 1003 rows 1003 cols
[2024-05-30 14:37:07] [INFO ] Computed 81 invariants in 30 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :19 after 49
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :49 after 229
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :229 after 2.80904e+06
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :2.80904e+06 after 3.60626e+12
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :3.60626e+12 after 2.33771e+26
Invariant property ShieldRVt-PT-020B-ReachabilityCardinality-2024-09 does not hold.
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property ShieldRVt-PT-020B-ReachabilityCardinality-2024-04 does not hold.
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 512
At refinement iteration 2 (OVERLAPS) 905/1003 variables, 81/179 constraints. Problems are: Problem set: 2 solved, 4 unsolved
SDD size :2.33771e+26 after 1.8507e+46
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.8507e+46 after 1.8507e+46
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 905/1084 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 0/1084 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1003/2006 variables, 1003/2087 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2006 variables, 0/2087 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/2006 variables, 0/2087 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2006/2006 variables, and 2087 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1078 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 914/993 variables, 80/159 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/993 variables, 914/1073 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-30 14:37:09] [INFO ] Deduced a trap composed of 37 places in 290 ms of which 39 ms to minimize.
[2024-05-30 14:37:09] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 4 ms to minimize.
[2024-05-30 14:37:09] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 5 ms to minimize.
[2024-05-30 14:37:10] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 4 ms to minimize.
[2024-05-30 14:37:10] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 4 ms to minimize.
[2024-05-30 14:37:10] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 4 ms to minimize.
[2024-05-30 14:37:10] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 4 ms to minimize.
[2024-05-30 14:37:11] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 4 ms to minimize.
[2024-05-30 14:37:11] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 3 ms to minimize.
[2024-05-30 14:37:11] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 4 ms to minimize.
[2024-05-30 14:37:11] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 4 ms to minimize.
[2024-05-30 14:37:11] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 4 ms to minimize.
[2024-05-30 14:37:11] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 4 ms to minimize.
[2024-05-30 14:37:12] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 3 ms to minimize.
[2024-05-30 14:37:12] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 4 ms to minimize.
[2024-05-30 14:37:12] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 4 ms to minimize.
[2024-05-30 14:37:12] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 4 ms to minimize.
[2024-05-30 14:37:12] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 4 ms to minimize.
[2024-05-30 14:37:13] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 4 ms to minimize.
[2024-05-30 14:37:13] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/993 variables, 20/1093 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-30 14:37:13] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 3 ms to minimize.
[2024-05-30 14:37:13] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 3 ms to minimize.
[2024-05-30 14:37:13] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 3 ms to minimize.
[2024-05-30 14:37:13] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 3 ms to minimize.
[2024-05-30 14:37:13] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 2 ms to minimize.
[2024-05-30 14:37:13] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
SMT process timed out in 6279ms, After SMT, problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 79 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 266 rules applied. Total rules applied 266 place count 1003 transition count 737
Reduce places removed 266 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 268 rules applied. Total rules applied 534 place count 737 transition count 735
Reduce places removed 1 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 2 with 19 rules applied. Total rules applied 553 place count 736 transition count 717
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 571 place count 718 transition count 717
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 78 Pre rules applied. Total rules applied 571 place count 718 transition count 639
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 727 place count 640 transition count 639
Discarding 110 places :
Symmetric choice reduction at 4 with 110 rule applications. Total rules 837 place count 530 transition count 529
Iterating global reduction 4 with 110 rules applied. Total rules applied 947 place count 530 transition count 529
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 947 place count 530 transition count 489
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 1027 place count 490 transition count 489
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 167
Deduced a syphon composed of 167 places in 1 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 4 with 334 rules applied. Total rules applied 1361 place count 323 transition count 322
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 1447 place count 280 transition count 349
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1453 place count 280 transition count 343
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1459 place count 274 transition count 343
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1462 place count 274 transition count 340
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1463 place count 274 transition count 340
Applied a total of 1463 rules in 212 ms. Remains 274 /1003 variables (removed 729) and now considering 340/1003 (removed 663) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 274/1003 places, 340/1003 transitions.
RANDOM walk for 40000 steps (8 resets) in 871 ms. (45 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 3/4 properties
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 340 rows 274 cols
[2024-05-30 14:37:14] [INFO ] Computed 81 invariants in 12 ms
[2024-05-30 14:37:14] [INFO ] State equation strengthened by 119 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 212/270 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/274 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 340/614 variables, 274/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 119/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/614 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/614 variables, and 474 constraints, problems are : Problem set: 0 solved, 3 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 274/274 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 212/270 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 14:37:15] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-30 14:37:15] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-30 14:37:15] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-30 14:37:15] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 14:37:15] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:37:15] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-30 14:37:15] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:37:15] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 5 ms to minimize.
[2024-05-30 14:37:15] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/274 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 14:37:15] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 340/614 variables, 274/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 119/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 3/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 14:37:15] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-30 14:37:16] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/614 variables, 2/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/614 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/614 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 614/614 variables, and 489 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1390 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 274/274 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints]
After SMT, in 1720ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 323 ms.
Support contains 58 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 340/340 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 274 transition count 332
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 266 transition count 331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 265 transition count 331
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 265 transition count 329
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 263 transition count 329
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 50 place count 249 transition count 315
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 56 place count 246 transition count 316
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 246 transition count 316
Applied a total of 57 rules in 42 ms. Remains 246 /274 variables (removed 28) and now considering 316/340 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 246/274 places, 316/340 transitions.
RANDOM walk for 40000 steps (8 resets) in 265 ms. (150 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 192 ms. (207 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 270016 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 3
Probabilistic random walk after 270016 steps, saw 161818 distinct states, run finished after 3008 ms. (steps per millisecond=89 ) properties seen :0
// Phase 1: matrix 316 rows 246 cols
[2024-05-30 14:37:20] [INFO ] Computed 81 invariants in 3 ms
[2024-05-30 14:37:20] [INFO ] State equation strengthened by 128 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 185/243 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/246 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 316/562 variables, 246/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 128/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/562 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 455 constraints, problems are : Problem set: 0 solved, 3 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 246/246 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 185/243 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 14:37:20] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-30 14:37:20] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:37:20] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-30 14:37:20] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 3/246 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 316/562 variables, 246/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 128/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 3/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/562 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 462 constraints, problems are : Problem set: 0 solved, 3 unsolved in 928 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 246/246 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 1259ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1330 ms.
Support contains 58 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 316/316 transitions.
Applied a total of 0 rules in 9 ms. Remains 246 /246 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 246/246 places, 316/316 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 316/316 transitions.
Applied a total of 0 rules in 8 ms. Remains 246 /246 variables (removed 0) and now considering 316/316 (removed 0) transitions.
[2024-05-30 14:37:22] [INFO ] Invariant cache hit.
[2024-05-30 14:37:22] [INFO ] Implicit Places using invariants in 120 ms returned [236]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 245/246 places, 316/316 transitions.
Applied a total of 0 rules in 8 ms. Remains 245 /245 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 143 ms. Remains : 245/246 places, 316/316 transitions.
RANDOM walk for 40000 steps (9 resets) in 260 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 386107 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 3
Probabilistic random walk after 386107 steps, saw 232282 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
// Phase 1: matrix 316 rows 245 cols
[2024-05-30 14:37:25] [INFO ] Computed 80 invariants in 2 ms
[2024-05-30 14:37:25] [INFO ] State equation strengthened by 126 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 185/243 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/245 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 316/561 variables, 245/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 126/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/561 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/561 variables, and 451 constraints, problems are : Problem set: 0 solved, 3 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 245/245 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 185/243 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 14:37:26] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:37:26] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 14:37:26] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:37:26] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 14:37:26] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-30 14:37:26] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/245 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 316/561 variables, 245/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 126/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 3/460 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 14:37:26] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-30 14:37:27] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/561 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 561/561 variables, and 462 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1133 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 245/245 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 1434ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 923 ms.
Support contains 58 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 316/316 transitions.
Applied a total of 0 rules in 8 ms. Remains 245 /245 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 245/245 places, 316/316 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 316/316 transitions.
Applied a total of 0 rules in 8 ms. Remains 245 /245 variables (removed 0) and now considering 316/316 (removed 0) transitions.
[2024-05-30 14:37:28] [INFO ] Invariant cache hit.
[2024-05-30 14:37:28] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-30 14:37:28] [INFO ] Invariant cache hit.
[2024-05-30 14:37:28] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-05-30 14:37:28] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
[2024-05-30 14:37:28] [INFO ] Redundant transitions in 26 ms returned []
Running 315 sub problems to find dead transitions.
[2024-05-30 14:37:28] [INFO ] Invariant cache hit.
[2024-05-30 14:37:28] [INFO ] State equation strengthened by 126 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-05-30 14:37:31] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-30 14:37:31] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-30 14:37:31] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-30 14:37:31] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-30 14:37:31] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-30 14:37:32] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 9 ms to minimize.
[2024-05-30 14:37:32] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
[2024-05-30 14:37:32] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-05-30 14:37:32] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-30 14:37:32] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-30 14:37:32] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-30 14:37:32] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-30 14:37:33] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 13/93 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-05-30 14:37:34] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
[2024-05-30 14:37:34] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (OVERLAPS) 316/561 variables, 245/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 126/466 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (OVERLAPS) 0/561 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/561 variables, and 466 constraints, problems are : Problem set: 0 solved, 315 unsolved in 18165 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 245/245 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 15/95 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-05-30 14:37:48] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-05-30 14:37:51] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (OVERLAPS) 316/561 variables, 245/342 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 126/468 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 315/783 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-05-30 14:37:56] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-30 14:37:59] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 2/785 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-05-30 14:38:03] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 1/786 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/561 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/561 variables, and 786 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 245/245 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 20/20 constraints]
After SMT, in 48290ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 48300ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48931 ms. Remains : 245/245 places, 316/316 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 245 transition count 308
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 19 place count 245 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 27 place count 245 transition count 300
Applied a total of 27 rules in 22 ms. Remains 245 /245 variables (removed 0) and now considering 300/316 (removed 16) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 300 rows 245 cols
[2024-05-30 14:38:17] [INFO ] Computed 80 invariants in 1 ms
[2024-05-30 14:38:17] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-30 14:38:17] [INFO ] [Nat]Absence check using 80 positive place invariants in 16 ms returned sat
[2024-05-30 14:38:17] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-30 14:38:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 14:38:17] [INFO ] After 76ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-30 14:38:17] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:38:17] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-30 14:38:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2024-05-30 14:38:17] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:38:17] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:38:17] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-30 14:38:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 152 ms
TRAPS : Iteration 1
[2024-05-30 14:38:18] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-30 14:38:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-30 14:38:18] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-30 14:38:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
TRAPS : Iteration 2
[2024-05-30 14:38:18] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-30 14:38:18] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:38:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
TRAPS : Iteration 3
[2024-05-30 14:38:18] [INFO ] After 891ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-30 14:38:18] [INFO ] After 1227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2024-05-30 14:38:18] [INFO ] Flatten gal took : 26 ms
[2024-05-30 14:38:18] [INFO ] Flatten gal took : 27 ms
[2024-05-30 14:38:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8447183193291614772.gal : 10 ms
[2024-05-30 14:38:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7239317171299521023.prop : 1 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/ReachabilityCardinality8447183193291614772.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7239317171299521023.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 ...328
Loading property file /tmp/ReachabilityCardinality7239317171299521023.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :9 after 12
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :12 after 26
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :26 after 182
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :182 after 38882
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :9.3312e+07 after 1.13832e+08
Detected timeout of ITS tools.
[2024-05-30 14:38:33] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:38:33] [INFO ] Applying decomposition
[2024-05-30 14:38:33] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9228869671376646938.txt' '-o' '/tmp/graph9228869671376646938.bin' '-w' '/tmp/graph9228869671376646938.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9228869671376646938.bin' '-l' '-1' '-v' '-w' '/tmp/graph9228869671376646938.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:38:33] [INFO ] Decomposing Gal with order
[2024-05-30 14:38:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:38:33] [INFO ] Removed a total of 245 redundant transitions.
[2024-05-30 14:38:34] [INFO ] Flatten gal took : 65 ms
[2024-05-30 14:38:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 17 ms.
[2024-05-30 14:38:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5113826194392564998.gal : 6 ms
[2024-05-30 14:38:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7132320901400294430.prop : 1 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/ReachabilityCardinality5113826194392564998.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7132320901400294430.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality7132320901400294430.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :49 after 1177
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1177 after 3337
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1.7496e+08 after 7.09518e+16
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.94948e+32,1.05183,45700,621,33,86275,260,830,232253,77,748,0
Total reachable state count : 294947600758009294953378113126400

Verifying 3 reachability properties.
Invariant property ShieldRVt-PT-020B-ReachabilityCardinality-2024-03 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-020B-ReachabilityCardinality-2024-03,1.20505e+29,1.06266,45960,547,32,86275,260,910,232253,85,748,2008
Reachability property ShieldRVt-PT-020B-ReachabilityCardinality-2024-05 does not hold.
No reachable states exhibit your property : ShieldRVt-PT-020B-ReachabilityCardinality-2024-05

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-020B-ReachabilityCardinality-2024-05,0,1.06395,45960,1,0,86275,260,926,232253,85,748,2355
Reachability property ShieldRVt-PT-020B-ReachabilityCardinality-2024-07 does not hold.
No reachable states exhibit your property : ShieldRVt-PT-020B-ReachabilityCardinality-2024-07

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-020B-ReachabilityCardinality-2024-07,0,1.06432,45960,1,0,86275,260,932,232253,85,748,2363
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES OVER_APPROXIMATION
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES OVER_APPROXIMATION
Over-approximation ignoring read arcs solved -2 properties in 17835 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 14:38:35] [INFO ] Flatten gal took : 33 ms
[2024-05-30 14:38:35] [INFO ] Applying decomposition
[2024-05-30 14:38:35] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4717572420560633917.txt' '-o' '/tmp/graph4717572420560633917.bin' '-w' '/tmp/graph4717572420560633917.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4717572420560633917.bin' '-l' '-1' '-v' '-w' '/tmp/graph4717572420560633917.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:38:35] [INFO ] Decomposing Gal with order
[2024-05-30 14:38:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:38:35] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-30 14:38:35] [INFO ] Flatten gal took : 60 ms
[2024-05-30 14:38:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-30 14:38:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1000595016158492708.gal : 15 ms
[2024-05-30 14:38:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality223736068611581091.prop : 0 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/ReachabilityCardinality1000595016158492708.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality223736068611581091.prop' '--nowitness'

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 ...306
Loading property file /tmp/ReachabilityCardinality223736068611581091.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 211
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :211 after 303871
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :303871 after 5.99655e+10
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5.99655e+10 after 1.51865e+11
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.37496e+51 after 1.37607e+51
ITS-tools command line returned an error code 137
[2024-05-30 14:58:09] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7509235033951138079
[2024-05-30 14:58:09] [INFO ] Applying decomposition
[2024-05-30 14:58:09] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:58:09] [INFO ] Computing symmetric may disable matrix : 316 transitions.
[2024-05-30 14:58:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 14:58:09] [INFO ] Computing symmetric may enable matrix : 316 transitions.
[2024-05-30 14:58:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4310738158451145866.txt' '-o' '/tmp/graph4310738158451145866.bin' '-w' '/tmp/graph4310738158451145866.weights'
[2024-05-30 14:58:09] [INFO ] Computing Do-Not-Accords matrix : 316 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4310738158451145866.bin' '-l' '-1' '-v' '-w' '/tmp/graph4310738158451145866.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:58:09] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 14:58:09] [INFO ] Decomposing Gal with order
[2024-05-30 14:58:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:58:09] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7509235033951138079
Running compilation step : cd /tmp/ltsmin7509235033951138079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-30 14:58:09] [INFO ] Removed a total of 325 redundant transitions.
[2024-05-30 14:58:09] [INFO ] Flatten gal took : 39 ms
[2024-05-30 14:58:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 15 ms.
[2024-05-30 14:58:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5885458660606696499.gal : 5 ms
[2024-05-30 14:58:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7595130167036043321.prop : 1 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/ReachabilityCardinality5885458660606696499.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7595130167036043321.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality7595130167036043321.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 25
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :49 after 2185
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2185 after 6505
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6505 after 116665
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.7496e+08 after 2.36592e+17
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.32621e+32,0.735612,31840,638,101,50963,1037,819,159954,141,5288,0
Total reachable state count : 232620948033962867869400824807424

Verifying 1 reachability properties.
Invariant property ShieldRVt-PT-020B-ReachabilityCardinality-2024-03 does not hold.
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-020B-ReachabilityCardinality-2024-03,9.64208e+28,0.745851,32100,548,77,50963,1037,900,159954,152,5288,1726
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1263853 ms.

BK_STOP 1717081090175

--------------------
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="ShieldRVt-PT-020B"
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 ShieldRVt-PT-020B, 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 r356-tall-171683762300990"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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