Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713800638.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldPPPt-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713800638
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 21:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 21:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 21:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 21:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 21:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 376K Mar 5 18:23 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 ShieldPPPt-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679217144698

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-19 09:12:26] [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]
[2023-03-19 09:12:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 09:12:27] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2023-03-19 09:12:27] [INFO ] Transformed 1563 places.
[2023-03-19 09:12:27] [INFO ] Transformed 1423 transitions.
[2023-03-19 09:12:27] [INFO ] Found NUPN structural information;
[2023-03-19 09:12:27] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 09:12:27] [INFO ] Flatten gal took : 221 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 12) seen :7
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
[2023-03-19 09:12:27] [INFO ] Flatten gal took : 96 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
[2023-03-19 09:12:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality39026256584505412.gal : 54 ms
[2023-03-19 09:12:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3698173309378001163.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality39026256584505412.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3698173309378001163.prop' '--nowitness' '--gen-order' 'FOLLOW'
Running SMT prover for 5 properties.
// Phase 1: matrix 1423 rows 1563 cols

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...326
[2023-03-19 09:12:28] [INFO ] Computed 221 place invariants in 23 ms
Loading property file /tmp/ReachabilityCardinality3698173309378001163.prop.
[2023-03-19 09:12:28] [INFO ] After 482ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 09:12:28] [INFO ] [Nat]Absence check using 221 positive place invariants in 60 ms returned sat
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :19 after 28
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :28 after 44
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :44 after 853
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :853 after 534613
Reachability property ShieldPPPt-PT-020B-ReachabilityCardinality-11 is true.
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :534613 after 1.15741e+09
Reachability property ShieldPPPt-PT-020B-ReachabilityCardinality-13 is true.
Invariant property ShieldPPPt-PT-020B-ReachabilityCardinality-02 does not hold.
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :1.15741e+09 after 2.45851e+13
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :2.45851e+13 after 2.52579e+17
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :2.52579e+17 after 2.08893e+24
[2023-03-19 09:12:30] [INFO ] After 1643ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 09:12:31] [INFO ] Deduced a trap composed of 22 places in 410 ms of which 6 ms to minimize.
[2023-03-19 09:12:31] [INFO ] Deduced a trap composed of 39 places in 341 ms of which 2 ms to minimize.
[2023-03-19 09:12:32] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 1 ms to minimize.
[2023-03-19 09:12:32] [INFO ] Deduced a trap composed of 36 places in 284 ms of which 1 ms to minimize.
[2023-03-19 09:12:32] [INFO ] Deduced a trap composed of 20 places in 249 ms of which 3 ms to minimize.
[2023-03-19 09:12:33] [INFO ] Deduced a trap composed of 29 places in 227 ms of which 1 ms to minimize.
[2023-03-19 09:12:33] [INFO ] Deduced a trap composed of 22 places in 294 ms of which 1 ms to minimize.
[2023-03-19 09:12:33] [INFO ] Deduced a trap composed of 29 places in 278 ms of which 1 ms to minimize.
[2023-03-19 09:12:34] [INFO ] Deduced a trap composed of 30 places in 281 ms of which 1 ms to minimize.
[2023-03-19 09:12:34] [INFO ] Deduced a trap composed of 38 places in 247 ms of which 1 ms to minimize.
[2023-03-19 09:12:34] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 1 ms to minimize.
[2023-03-19 09:12:35] [INFO ] Deduced a trap composed of 29 places in 283 ms of which 1 ms to minimize.
[2023-03-19 09:12:35] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 1 ms to minimize.
[2023-03-19 09:12:35] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 0 ms to minimize.
[2023-03-19 09:12:36] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 0 ms to minimize.
[2023-03-19 09:12:36] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 1 ms to minimize.
[2023-03-19 09:12:36] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 5455 ms
[2023-03-19 09:12:36] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 1 ms to minimize.
[2023-03-19 09:12:36] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 1 ms to minimize.
[2023-03-19 09:12:37] [INFO ] Deduced a trap composed of 28 places in 270 ms of which 1 ms to minimize.
[2023-03-19 09:12:37] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 2 ms to minimize.
[2023-03-19 09:12:37] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 2 ms to minimize.
[2023-03-19 09:12:38] [INFO ] Deduced a trap composed of 30 places in 313 ms of which 1 ms to minimize.
[2023-03-19 09:12:38] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 1 ms to minimize.
[2023-03-19 09:12:39] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 1 ms to minimize.
[2023-03-19 09:12:39] [INFO ] Deduced a trap composed of 25 places in 242 ms of which 0 ms to minimize.
[2023-03-19 09:12:39] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 1 ms to minimize.
[2023-03-19 09:12:39] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 0 ms to minimize.
[2023-03-19 09:12:40] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 1 ms to minimize.
[2023-03-19 09:12:40] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 1 ms to minimize.
[2023-03-19 09:12:40] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 1 ms to minimize.
[2023-03-19 09:12:40] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 0 ms to minimize.
[2023-03-19 09:12:41] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 0 ms to minimize.
[2023-03-19 09:12:41] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 1 ms to minimize.
[2023-03-19 09:12:41] [INFO ] Deduced a trap composed of 35 places in 289 ms of which 4 ms to minimize.
[2023-03-19 09:12:42] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 1 ms to minimize.
[2023-03-19 09:12:42] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5774 ms
[2023-03-19 09:12:42] [INFO ] Deduced a trap composed of 23 places in 426 ms of which 2 ms to minimize.
[2023-03-19 09:12:43] [INFO ] Deduced a trap composed of 25 places in 317 ms of which 0 ms to minimize.
[2023-03-19 09:12:43] [INFO ] Deduced a trap composed of 25 places in 395 ms of which 1 ms to minimize.
[2023-03-19 09:12:44] [INFO ] Deduced a trap composed of 26 places in 365 ms of which 0 ms to minimize.
[2023-03-19 09:12:44] [INFO ] Deduced a trap composed of 35 places in 316 ms of which 2 ms to minimize.
[2023-03-19 09:12:44] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 1 ms to minimize.
[2023-03-19 09:12:45] [INFO ] Deduced a trap composed of 31 places in 247 ms of which 0 ms to minimize.
[2023-03-19 09:12:45] [INFO ] Deduced a trap composed of 31 places in 252 ms of which 2 ms to minimize.
[2023-03-19 09:12:45] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 1 ms to minimize.
[2023-03-19 09:12:46] [INFO ] Deduced a trap composed of 31 places in 263 ms of which 1 ms to minimize.
[2023-03-19 09:12:46] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 1 ms to minimize.
[2023-03-19 09:12:46] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 1 ms to minimize.
[2023-03-19 09:12:47] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 1 ms to minimize.
[2023-03-19 09:12:47] [INFO ] Deduced a trap composed of 30 places in 277 ms of which 1 ms to minimize.
[2023-03-19 09:12:47] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 1 ms to minimize.
[2023-03-19 09:12:48] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 1 ms to minimize.
[2023-03-19 09:12:48] [INFO ] Deduced a trap composed of 32 places in 662 ms of which 1 ms to minimize.
[2023-03-19 09:12:49] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 13 ms to minimize.
[2023-03-19 09:12:49] [INFO ] Deduced a trap composed of 26 places in 225 ms of which 0 ms to minimize.
[2023-03-19 09:12:49] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 1 ms to minimize.
[2023-03-19 09:12:49] [INFO ] Deduced a trap composed of 25 places in 250 ms of which 22 ms to minimize.
[2023-03-19 09:12:50] [INFO ] Deduced a trap composed of 44 places in 275 ms of which 1 ms to minimize.
[2023-03-19 09:12:50] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 0 ms to minimize.
[2023-03-19 09:12:50] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 0 ms to minimize.
[2023-03-19 09:12:51] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 0 ms to minimize.
[2023-03-19 09:12:51] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 3 ms to minimize.
[2023-03-19 09:12:51] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 1 ms to minimize.
[2023-03-19 09:12:51] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 0 ms to minimize.
[2023-03-19 09:12:52] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 1 ms to minimize.
[2023-03-19 09:12:52] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 0 ms to minimize.
[2023-03-19 09:12:52] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 0 ms to minimize.
[2023-03-19 09:12:52] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 10136 ms
[2023-03-19 09:12:52] [INFO ] After 23769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 769 ms.
[2023-03-19 09:12:53] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 287 ms.
Support contains 54 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Drop transitions removed 339 transitions
Trivial Post-agglo rules discarded 339 transitions
Performed 339 trivial Post agglomeration. Transition count delta: 339
Iterating post reduction 0 with 339 rules applied. Total rules applied 339 place count 1563 transition count 1084
Reduce places removed 339 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 353 rules applied. Total rules applied 692 place count 1224 transition count 1070
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 706 place count 1210 transition count 1070
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 706 place count 1210 transition count 986
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 874 place count 1126 transition count 986
Discarding 130 places :
Symmetric choice reduction at 3 with 130 rule applications. Total rules 1004 place count 996 transition count 856
Iterating global reduction 3 with 130 rules applied. Total rules applied 1134 place count 996 transition count 856
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 1134 place count 996 transition count 803
Deduced a syphon composed of 53 places in 2 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 1240 place count 943 transition count 803
Performed 322 Post agglomeration using F-continuation condition.Transition count delta: 322
Deduced a syphon composed of 322 places in 2 ms
Reduce places removed 322 places and 0 transitions.
Iterating global reduction 3 with 644 rules applied. Total rules applied 1884 place count 621 transition count 481
Renaming transitions due to excessive name length > 1024 char.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1984 place count 571 transition count 481
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1988 place count 571 transition count 477
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1992 place count 567 transition count 477
Partial Free-agglomeration rule applied 47 times.
Drop transitions removed 47 transitions
Iterating global reduction 4 with 47 rules applied. Total rules applied 2039 place count 567 transition count 477
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2040 place count 566 transition count 476
Applied a total of 2040 rules in 430 ms. Remains 566 /1563 variables (removed 997) and now considering 476/1423 (removed 947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 431 ms. Remains : 566/1563 places, 476/1423 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 4) seen :1
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 476 rows 566 cols
[2023-03-19 09:12:54] [INFO ] Computed 221 place invariants in 2 ms
[2023-03-19 09:12:54] [INFO ] [Real]Absence check using 221 positive place invariants in 31 ms returned sat
[2023-03-19 09:12:54] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 09:12:54] [INFO ] [Nat]Absence check using 221 positive place invariants in 28 ms returned sat
[2023-03-19 09:12:55] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 09:12:55] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-19 09:12:55] [INFO ] After 110ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 09:12:55] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 9 ms to minimize.
[2023-03-19 09:12:55] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2023-03-19 09:12:55] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2023-03-19 09:12:55] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2023-03-19 09:12:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 423 ms
[2023-03-19 09:12:55] [INFO ] After 644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-19 09:12:55] [INFO ] After 1126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 18 ms.
Support contains 14 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 476/476 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 566 transition count 465
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 555 transition count 465
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 22 place count 555 transition count 456
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 40 place count 546 transition count 456
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 545 transition count 455
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 545 transition count 455
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 69 place count 531 transition count 442
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 531 transition count 440
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 71 place count 531 transition count 438
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 529 transition count 438
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 89 place count 522 transition count 437
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 96 place count 522 transition count 437
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 104 place count 514 transition count 429
Applied a total of 104 rules in 138 ms. Remains 514 /566 variables (removed 52) and now considering 429/476 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 514/566 places, 429/476 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :1
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 429 rows 514 cols
[2023-03-19 09:12:56] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-19 09:12:56] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 09:12:56] [INFO ] [Nat]Absence check using 220 positive place invariants in 24 ms returned sat
[2023-03-19 09:12:56] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 09:12:56] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-19 09:12:56] [INFO ] After 33ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 09:12:56] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2023-03-19 09:12:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-19 09:12:56] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-19 09:12:56] [INFO ] After 551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 26 ms.
Support contains 13 out of 514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 429/429 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 513 transition count 428
Applied a total of 2 rules in 40 ms. Remains 513 /514 variables (removed 1) and now considering 428/429 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 513/514 places, 428/429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 237637 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 237637 steps, saw 200579 distinct states, run finished after 3002 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 428 rows 513 cols
[2023-03-19 09:13:00] [INFO ] Computed 220 place invariants in 6 ms
[2023-03-19 09:13:00] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 09:13:00] [INFO ] [Nat]Absence check using 220 positive place invariants in 61 ms returned sat
[2023-03-19 09:13:00] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 09:13:00] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-19 09:13:00] [INFO ] After 74ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 09:13:00] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2023-03-19 09:13:01] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2023-03-19 09:13:01] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2023-03-19 09:13:01] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2023-03-19 09:13:01] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 0 ms to minimize.
[2023-03-19 09:13:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 671 ms
[2023-03-19 09:13:01] [INFO ] After 842ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-19 09:13:01] [INFO ] After 1429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 25 ms.
Support contains 13 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 428/428 transitions.
Applied a total of 0 rules in 19 ms. Remains 513 /513 variables (removed 0) and now considering 428/428 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 513/513 places, 428/428 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 428/428 transitions.
Applied a total of 0 rules in 15 ms. Remains 513 /513 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2023-03-19 09:13:01] [INFO ] Invariant cache hit.
[2023-03-19 09:13:02] [INFO ] Implicit Places using invariants in 508 ms returned [496, 500]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 511 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 511/513 places, 428/428 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 509 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 509 transition count 426
Applied a total of 4 rules in 51 ms. Remains 509 /511 variables (removed 2) and now considering 426/428 (removed 2) transitions.
// Phase 1: matrix 426 rows 509 cols
[2023-03-19 09:13:02] [INFO ] Computed 218 place invariants in 3 ms
[2023-03-19 09:13:02] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-19 09:13:02] [INFO ] Invariant cache hit.
[2023-03-19 09:13:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 09:13:03] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 509/513 places, 426/428 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1457 ms. Remains : 509/513 places, 426/428 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 280158 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 280158 steps, saw 237887 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 09:13:06] [INFO ] Invariant cache hit.
[2023-03-19 09:13:06] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 09:13:06] [INFO ] [Nat]Absence check using 218 positive place invariants in 54 ms returned sat
[2023-03-19 09:13:06] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 09:13:06] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 09:13:06] [INFO ] After 60ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 09:13:07] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2023-03-19 09:13:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2023-03-19 09:13:07] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2023-03-19 09:13:07] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-03-19 09:13:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2023-03-19 09:13:07] [INFO ] After 545ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-19 09:13:07] [INFO ] After 1043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 13 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 426/426 transitions.
Applied a total of 0 rules in 15 ms. Remains 509 /509 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 509/509 places, 426/426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 426/426 transitions.
Applied a total of 0 rules in 12 ms. Remains 509 /509 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2023-03-19 09:13:07] [INFO ] Invariant cache hit.
[2023-03-19 09:13:07] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-19 09:13:07] [INFO ] Invariant cache hit.
[2023-03-19 09:13:08] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 09:13:08] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 962 ms to find 0 implicit places.
[2023-03-19 09:13:08] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-19 09:13:08] [INFO ] Invariant cache hit.
[2023-03-19 09:13:08] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1265 ms. Remains : 509/509 places, 426/426 transitions.
Partial Free-agglomeration rule applied 107 times.
Drop transitions removed 107 transitions
Iterating global reduction 0 with 107 rules applied. Total rules applied 107 place count 509 transition count 426
Applied a total of 107 rules in 17 ms. Remains 509 /509 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 426 rows 509 cols
[2023-03-19 09:13:08] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-19 09:13:08] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 09:13:09] [INFO ] [Nat]Absence check using 218 positive place invariants in 60 ms returned sat
[2023-03-19 09:13:09] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 09:13:09] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-19 09:13:09] [INFO ] After 118ms SMT Verify possible using 96 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 09:13:09] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2023-03-19 09:13:09] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 0 ms to minimize.
[2023-03-19 09:13:09] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2023-03-19 09:13:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 427 ms
[2023-03-19 09:13:09] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2023-03-19 09:13:09] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 0 ms to minimize.
[2023-03-19 09:13:10] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2023-03-19 09:13:10] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2023-03-19 09:13:10] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2023-03-19 09:13:10] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2023-03-19 09:13:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 543 ms
[2023-03-19 09:13:10] [INFO ] After 1135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-19 09:13:10] [INFO ] After 1555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-19 09:13:10] [INFO ] Flatten gal took : 25 ms
[2023-03-19 09:13:10] [INFO ] Flatten gal took : 25 ms
[2023-03-19 09:13:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality518831752306795146.gal : 3 ms
[2023-03-19 09:13:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11490750810597212607.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality518831752306795146.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11490750810597212607.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.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality11490750810597212607.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 27
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :27 after 247
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :247 after 337
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :337 after 1433
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1433 after 15237
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :15237 after 956195
Invariant property ShieldPPPt-PT-020B-ReachabilityCardinality-14 does not hold.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :956195 after 7.46772e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.46772e+07 after 2.60993e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.60993e+09 after 1.94667e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.94667e+10 after 9.38641e+11
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :9.38641e+11 after 3.58045e+15
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.58045e+15 after 1.5938e+19
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.5938e+19 after 5.37129e+23
Detected timeout of ITS tools.
[2023-03-19 09:13:25] [INFO ] Flatten gal took : 24 ms
[2023-03-19 09:13:25] [INFO ] Applying decomposition
[2023-03-19 09:13:25] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18386561058172451753.txt' '-o' '/tmp/graph18386561058172451753.bin' '-w' '/tmp/graph18386561058172451753.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18386561058172451753.bin' '-l' '-1' '-v' '-w' '/tmp/graph18386561058172451753.weights' '-q' '0' '-e' '0.001'
[2023-03-19 09:13:25] [INFO ] Decomposing Gal with order
[2023-03-19 09:13:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 09:13:25] [INFO ] Removed a total of 103 redundant transitions.
[2023-03-19 09:13:25] [INFO ] Flatten gal took : 70 ms
[2023-03-19 09:13:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 8 ms.
[2023-03-19 09:13:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15008183794479717125.gal : 8 ms
[2023-03-19 09:13:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16628430225133245809.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15008183794479717125.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16628430225133245809.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality16628430225133245809.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 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.93795e+06 after 1.12069e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.12069e+08 after 2.45235e+18
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.45235e+18 after 1.08435e+25
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13649229844754317477
[2023-03-19 09:13:41] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13649229844754317477
Running compilation step : cd /tmp/ltsmin13649229844754317477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 916 ms.
Running link step : cd /tmp/ltsmin13649229844754317477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin13649229844754317477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldPPPtPT020BReachabilityCardinality12==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 09:13:56] [INFO ] Flatten gal took : 76 ms
[2023-03-19 09:13:56] [INFO ] Applying decomposition
[2023-03-19 09:13:56] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5158605431979693157.txt' '-o' '/tmp/graph5158605431979693157.bin' '-w' '/tmp/graph5158605431979693157.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5158605431979693157.bin' '-l' '-1' '-v' '-w' '/tmp/graph5158605431979693157.weights' '-q' '0' '-e' '0.001'
[2023-03-19 09:13:56] [INFO ] Decomposing Gal with order
[2023-03-19 09:13:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 09:13:56] [INFO ] Removed a total of 120 redundant transitions.
[2023-03-19 09:13:56] [INFO ] Flatten gal took : 98 ms
[2023-03-19 09:13:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2023-03-19 09:13:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14970094351178384528.gal : 20 ms
[2023-03-19 09:13:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9009025937382794998.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14970094351178384528.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9009025937382794998.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality9009025937382794998.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 30394
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :30394 after 1.36553e+54
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.36553e+54 after 3.58193e+61
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-19 09:44:00] [INFO ] Flatten gal took : 495 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16862468434063394838
[2023-03-19 09:44:00] [INFO ] Computing symmetric may disable matrix : 426 transitions.
[2023-03-19 09:44:00] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:44:00] [INFO ] Computing symmetric may enable matrix : 426 transitions.
[2023-03-19 09:44:00] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:44:00] [INFO ] Applying decomposition
[2023-03-19 09:44:00] [INFO ] Flatten gal took : 163 ms
[2023-03-19 09:44:01] [INFO ] Computing Do-Not-Accords matrix : 426 transitions.
[2023-03-19 09:44:01] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:44:01] [INFO ] Built C files in 744ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16862468434063394838
Running compilation step : cd /tmp/ltsmin16862468434063394838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6498372150068069514.txt' '-o' '/tmp/graph6498372150068069514.bin' '-w' '/tmp/graph6498372150068069514.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6498372150068069514.bin' '-l' '-1' '-v' '-w' '/tmp/graph6498372150068069514.weights' '-q' '0' '-e' '0.001'
[2023-03-19 09:44:02] [INFO ] Decomposing Gal with order
[2023-03-19 09:44:02] [INFO ] Rewriting arrays to variables to allow decomposition.
Compilation finished in 1266 ms.
Running link step : cd /tmp/ltsmin16862468434063394838;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 111 ms.
Running LTSmin : cd /tmp/ltsmin16862468434063394838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT020BReachabilityCardinality12==true'
[2023-03-19 09:44:02] [INFO ] Removed a total of 269 redundant transitions.
[2023-03-19 09:44:03] [INFO ] Flatten gal took : 539 ms
[2023-03-19 09:44:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 66 ms.
[2023-03-19 09:44:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14825985408520823973.gal : 33 ms
[2023-03-19 09:44:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13560532819480336482.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14825985408520823973.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13560532819480336482.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality13560532819480336482.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
Invariant property ShieldPPPt-PT-020B-ReachabilityCardinality-14 does not hold.
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7.52371e+06 after 1.42762e+31
pins2lts-mc-linux64, 0.002: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.020: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.042: Initializing POR dependencies: labels 428, guards 426
pins2lts-mc-linux64( 7/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.041: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.041: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.076: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.317: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 2.965: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 3/ 8), 3.026: "ShieldPPPtPT020BReachabilityCardinality12==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 3.030: "ShieldPPPtPT020BReachabilityCardinality12==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 3.026: "ShieldPPPtPT020BReachabilityCardinality12==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 3.030: "ShieldPPPtPT020BReachabilityCardinality12==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 3.031: "ShieldPPPtPT020BReachabilityCardinality12==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 3.031: "ShieldPPPtPT020BReachabilityCardinality12==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 3.031: There are 428 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 3.031: State length is 509, there are 426 groups
pins2lts-mc-linux64( 0/ 8), 3.031: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 3.031: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 3.031: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 3.031: Visible groups: 0 / 426, labels: 1 / 428
pins2lts-mc-linux64( 0/ 8), 3.031: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 3.031: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 3.032: "ShieldPPPtPT020BReachabilityCardinality12==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 3.028: "ShieldPPPtPT020BReachabilityCardinality12==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 3.064: ~5 levels ~960 states ~3752 transitions
pins2lts-mc-linux64( 0/ 8), 3.104: ~6 levels ~1920 states ~7152 transitions
pins2lts-mc-linux64( 0/ 8), 3.177: ~8 levels ~3840 states ~14720 transitions
pins2lts-mc-linux64( 0/ 8), 3.305: ~9 levels ~7680 states ~30136 transitions
pins2lts-mc-linux64( 0/ 8), 3.608: ~10 levels ~15360 states ~68968 transitions
pins2lts-mc-linux64( 5/ 8), 4.155: ~7 levels ~30720 states ~161248 transitions
pins2lts-mc-linux64( 5/ 8), 5.195: ~8 levels ~61440 states ~341512 transitions
pins2lts-mc-linux64( 3/ 8), 6.823: ~16 levels ~122880 states ~591408 transitions
pins2lts-mc-linux64( 3/ 8), 9.951: ~17 levels ~245760 states ~1268712 transitions
pins2lts-mc-linux64( 3/ 8), 15.998: ~18 levels ~491520 states ~2719704 transitions
pins2lts-mc-linux64( 3/ 8), 27.752: ~19 levels ~983040 states ~5767784 transitions
pins2lts-mc-linux64( 3/ 8), 52.377: ~20 levels ~1966080 states ~12543072 transitions
pins2lts-mc-linux64( 3/ 8), 104.094: ~21 levels ~3932160 states ~26569272 transitions
pins2lts-mc-linux64( 3/ 8), 214.036: ~23 levels ~7864320 states ~56964968 transitions
pins2lts-mc-linux64( 7/ 8), 383.112: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 383.191:
pins2lts-mc-linux64( 0/ 8), 383.191: mean standard work distribution: 7.5% (states) 4.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 383.191:
pins2lts-mc-linux64( 0/ 8), 383.191: Explored 11957551 states 100677274 transitions, fanout: 8.420
pins2lts-mc-linux64( 0/ 8), 383.191: Total exploration time 380.150 sec (380.090 sec minimum, 380.110 sec on average)
pins2lts-mc-linux64( 0/ 8), 383.191: States per second: 31455, Transitions per second: 264836
pins2lts-mc-linux64( 0/ 8), 383.192: Ignoring proviso: 7866289
pins2lts-mc-linux64( 0/ 8), 383.192:
pins2lts-mc-linux64( 0/ 8), 383.192: Queue width: 8B, total height: 11129286, memory: 84.91MB
pins2lts-mc-linux64( 0/ 8), 383.192: Tree memory: 432.1MB, 19.6 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 383.192: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 383.192: Stored 428 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 383.192: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 383.192: Est. total memory use: 517.0MB (~1108.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16862468434063394838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT020BReachabilityCardinality12==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16862468434063394838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT020BReachabilityCardinality12==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 15314280 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16200200 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="ShieldPPPt-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-5348"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-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 r389-oct2-167903713800638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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