fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r092-tall-171624189900718
Last Updated
July 7, 2024

About the Execution of ITS-Tools for DES-PT-40a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1188.611 223493.00 473628.00 472.90 FTTFFFTTFFTFTTFF normal

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.r092-tall-171624189900718.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 DES-PT-40a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189900718
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 08:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 08:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 08:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 83K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-00
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-01
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-02
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-03
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-04
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-05
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-06
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-07
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-08
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-09
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-10
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-11
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-12
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-13
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-14
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716353883190

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-22 04:58:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 04:58:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 04:58:04] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-22 04:58:04] [INFO ] Transformed 274 places.
[2024-05-22 04:58:04] [INFO ] Transformed 231 transitions.
[2024-05-22 04:58:04] [INFO ] Found NUPN structural information;
[2024-05-22 04:58:04] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-40a-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 04:58:05] [INFO ] Flatten gal took : 131 ms
[2024-05-22 04:58:05] [INFO ] Flatten gal took : 53 ms
[2024-05-22 04:58:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3729607446352215904.gal : 35 ms
[2024-05-22 04:58:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2062604976298790825.prop : 9 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/ReachabilityCardinality3729607446352215904.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2062604976298790825.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/ReachabilityCardinality2062604976298790825.prop.
RANDOM walk for 40000 steps (911 resets) in 2053 ms. (19 steps per ms) remains 9/13 properties
FORMULA DES-PT-40a-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :14 after 17
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :17 after 55
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :55 after 67
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :67 after 173
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :173 after 1587
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :1587 after 3869
BEST_FIRST walk for 40003 steps (209 resets) in 673 ms. (59 steps per ms) remains 9/9 properties
Reachability property DES-PT-40a-ReachabilityCardinality-2024-13 is true.
Invariant property DES-PT-40a-ReachabilityCardinality-2024-03 does not hold.
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :3869 after 173233
BEST_FIRST walk for 40003 steps (185 resets) in 197 ms. (202 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (233 resets) in 335 ms. (119 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (175 resets) in 213 ms. (186 steps per ms) remains 9/9 properties
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :173233 after 481869
BEST_FIRST walk for 40003 steps (162 resets) in 1077 ms. (37 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (186 resets) in 133 ms. (298 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (176 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (207 resets) in 252 ms. (158 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (172 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
// Phase 1: matrix 217 rows 274 cols
[2024-05-22 04:58:06] [INFO ] Computed 59 invariants in 30 ms
[2024-05-22 04:58:06] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,11 properties remain. new max is 2048
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 23/141 variables, 21/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD size :481869 after 1.31406e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 23/162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 25/166 variables, 13/176 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 25/201 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 88/254 variables, 22/225 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 88/313 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem DES-PT-40a-ReachabilityCardinality-2024-00 is UNSAT
FORMULA DES-PT-40a-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 13 (OVERLAPS) 216/470 variables, 254/567 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/470 variables, 1/568 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/470 variables, 0/568 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 21/491 variables, 20/588 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/491 variables, 20/608 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/491 variables, 0/608 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/491 variables, 0/608 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 608 constraints, problems are : Problem set: 1 solved, 8 unsolved in 3797 ms.
Refiners :[Domain max(s): 274/274 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 274/274 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 23/103 variables, 16/96 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 23/119 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 35/138 variables, 18/137 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 35/172 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/173 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 109/247 variables, 23/196 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 109/305 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/305 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 3/250 variables, 1/306 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 3/309 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-22 04:58:10] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 15 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 1/310 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 216/466 variables, 250/560 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/466 variables, 1/561 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/466 variables, 5/566 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/466 variables, 0/566 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 25/491 variables, 24/590 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/491 variables, 24/614 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/491 variables, 3/617 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 491/491 variables, and 617 constraints, problems are : Problem set: 1 solved, 8 unsolved in 5017 ms.
Refiners :[Domain max(s): 274/274 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 274/274 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 8971ms problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 80 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 217/217 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 274 transition count 215
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 274 transition count 215
Applied a total of 5 rules in 51 ms. Remains 274 /274 variables (removed 0) and now considering 215/217 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 274/274 places, 215/217 transitions.
RANDOM walk for 40000 steps (508 resets) in 532 ms. (75 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (84 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (204 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (93 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (68 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (85 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (91 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (80 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (81 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 662661 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :0 out of 8
Probabilistic random walk after 662661 steps, saw 95335 distinct states, run finished after 3004 ms. (steps per millisecond=220 ) properties seen :0
// Phase 1: matrix 215 rows 274 cols
[2024-05-22 04:58:18] [INFO ] Computed 61 invariants in 9 ms
[2024-05-22 04:58:18] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 29/109 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 29/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 35/144 variables, 18/146 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 35/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 107/251 variables, 23/205 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 107/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 215/466 variables, 251/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 4/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 23/489 variables, 23/590 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/489 variables, 23/613 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/489 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/489 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 613 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3768 ms.
Refiners :[Domain max(s): 274/274 constraints, Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 274/274 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 29/109 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 29/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 35/144 variables, 18/146 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 35/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 107/251 variables, 23/205 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 107/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 215/466 variables, 251/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 4/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 5/572 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 04:58:25] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 23/489 variables, 23/596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/489 variables, 23/619 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/489 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 04:58:28] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-22 04:58:29] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-22 04:58:29] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/489 variables, 3/625 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/489 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 04:58:32] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/489 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 04:58:35] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/489 variables, 1/627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/489 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 0/489 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 489/489 variables, and 627 constraints, problems are : Problem set: 0 solved, 8 unsolved in 18661 ms.
Refiners :[Domain max(s): 274/274 constraints, Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 274/274 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 6/6 constraints]
After SMT, in 22477ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 14816 ms.
Support contains 80 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 215/215 transitions.
Applied a total of 0 rules in 21 ms. Remains 274 /274 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 274/274 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 215/215 transitions.
Applied a total of 0 rules in 9 ms. Remains 274 /274 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-22 04:58:56] [INFO ] Invariant cache hit.
[2024-05-22 04:58:56] [INFO ] Implicit Places using invariants in 190 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 204 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 273/274 places, 215/215 transitions.
Applied a total of 0 rules in 9 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 222 ms. Remains : 273/274 places, 215/215 transitions.
RANDOM walk for 40000 steps (546 resets) in 224 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (84 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (204 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (85 resets) in 117 ms. (338 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (68 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (84 resets) in 69 ms. (571 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (93 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (81 resets) in 136 ms. (291 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (88 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 822754 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :0 out of 8
Probabilistic random walk after 822754 steps, saw 117238 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :0
// Phase 1: matrix 215 rows 273 cols
[2024-05-22 04:58:59] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 04:58:59] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 30/110 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 30/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 34/144 variables, 17/147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 34/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 106/250 variables, 22/204 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 106/310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 215/465 variables, 250/560 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/465 variables, 3/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/465 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 23/488 variables, 23/586 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/488 variables, 23/609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/488 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/488 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 609 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3061 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 30/110 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 30/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 34/144 variables, 17/147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 34/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 106/250 variables, 22/204 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 106/310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 215/465 variables, 250/560 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/465 variables, 3/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/465 variables, 5/568 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/465 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 23/488 variables, 23/591 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/488 variables, 23/614 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/488 variables, 3/617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/488 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/488 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 617 constraints, problems are : Problem set: 0 solved, 8 unsolved in 14360 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 17455ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 14517 ms.
Support contains 80 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 215/215 transitions.
Applied a total of 0 rules in 7 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 273/273 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 215/215 transitions.
Applied a total of 0 rules in 7 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-22 04:59:31] [INFO ] Invariant cache hit.
[2024-05-22 04:59:31] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 04:59:31] [INFO ] Invariant cache hit.
[2024-05-22 04:59:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 04:59:32] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2024-05-22 04:59:32] [INFO ] Redundant transitions in 10 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-22 04:59:32] [INFO ] Invariant cache hit.
[2024-05-22 04:59:32] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 272/272 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 11/283 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/273 variables, 36/319 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 13/333 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 215/488 variables, 273/606 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 3/609 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 04:59:40] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 04:59:48] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :1.31406e+06 after 4.8411e+06
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 05:00:00] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/488 variables, and 612 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30014 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 272/272 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 11/283 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/273 variables, 36/319 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 13/333 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 05:00:03] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-05-22 05:00:04] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 2 ms to minimize.
[2024-05-22 05:00:05] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 215/488 variables, 273/612 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 3/615 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 214/829 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 05:00:23] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:00:25] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:00:30] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-22 05:00:31] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 833 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30016 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 10/10 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60848 ms. Remains : 273/273 places, 215/215 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 13 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Running SMT prover for 8 properties.
[2024-05-22 05:00:32] [INFO ] Invariant cache hit.
[2024-05-22 05:00:32] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 05:00:32] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2024-05-22 05:00:32] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-22 05:00:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 05:00:32] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2024-05-22 05:00:33] [INFO ] After 873ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-05-22 05:00:33] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:00:34] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2024-05-22 05:00:34] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:00:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 199 ms
[2024-05-22 05:00:34] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-22 05:00:34] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-22 05:00:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2024-05-22 05:00:34] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
[2024-05-22 05:00:34] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-22 05:00:34] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:00:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 195 ms
TRAPS : Iteration 1
[2024-05-22 05:00:35] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:00:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
TRAPS : Iteration 2
[2024-05-22 05:00:36] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:00:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
TRAPS : Iteration 3
[2024-05-22 05:00:37] [INFO ] After 4571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-05-22 05:00:38] [INFO ] After 5240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2024-05-22 05:00:38] [INFO ] Flatten gal took : 20 ms
[2024-05-22 05:00:38] [INFO ] Flatten gal took : 20 ms
[2024-05-22 05:00:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1754809735969124402.gal : 8 ms
[2024-05-22 05:00:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12312261632317118238.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/ReachabilityCardinality1754809735969124402.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12312261632317118238.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12312261632317118238.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :13 after 20
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :20 after 39
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :39 after 47
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :47 after 1043
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1043 after 1793
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :1793 after 3521
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :3521 after 282573
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :282573 after 1.17195e+06
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :1.17195e+06 after 4.09099e+06
Detected timeout of ITS tools.
[2024-05-22 05:00:53] [INFO ] Flatten gal took : 18 ms
[2024-05-22 05:00:53] [INFO ] Applying decomposition
[2024-05-22 05:00:53] [INFO ] Flatten gal took : 17 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/graph6487058456917795795.txt' '-o' '/tmp/graph6487058456917795795.bin' '-w' '/tmp/graph6487058456917795795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6487058456917795795.bin' '-l' '-1' '-v' '-w' '/tmp/graph6487058456917795795.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:00:53] [INFO ] Decomposing Gal with order
[2024-05-22 05:00:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:00:53] [INFO ] Removed a total of 21 redundant transitions.
[2024-05-22 05:00:53] [INFO ] Flatten gal took : 56 ms
[2024-05-22 05:00:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2024-05-22 05:00:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5230419661011171961.gal : 4 ms
[2024-05-22 05:00:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality158646180773559789.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/ReachabilityCardinality5230419661011171961.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality158646180773559789.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/ReachabilityCardinality158646180773559789.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :5 after 371
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :371 after 785
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :785 after 7973
Invariant property DES-PT-40a-ReachabilityCardinality-2024-04 does not hold.
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :7973 after 3.87855e+08
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :3.87855e+08 after 5.44887e+08
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :5.44887e+08 after 7.64731e+08
Invariant property DES-PT-40a-ReachabilityCardinality-2024-14 does not hold.
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :7.64731e+08 after 1.17301e+09
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :2.15819e+10 after 1.84377e+11
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :5.45676e+12 after 6.0817e+12
Invariant property DES-PT-40a-ReachabilityCardinality-2024-15 does not hold.
Invariant property DES-PT-40a-ReachabilityCardinality-2024-11 does not hold.
Reachability property DES-PT-40a-ReachabilityCardinality-2024-02 is true.
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.0475e+13 after 1.11022e+13
Reachability property DES-PT-40a-ReachabilityCardinality-2024-12 is true.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 35824 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 05:01:08] [INFO ] Flatten gal took : 20 ms
[2024-05-22 05:01:08] [INFO ] Applying decomposition
[2024-05-22 05:01:08] [INFO ] Flatten gal took : 14 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/graph13675716285588625468.txt' '-o' '/tmp/graph13675716285588625468.bin' '-w' '/tmp/graph13675716285588625468.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13675716285588625468.bin' '-l' '-1' '-v' '-w' '/tmp/graph13675716285588625468.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:01:08] [INFO ] Decomposing Gal with order
[2024-05-22 05:01:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:01:08] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-22 05:01:08] [INFO ] Flatten gal took : 25 ms
[2024-05-22 05:01:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 3 ms.
[2024-05-22 05:01:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16916473115032705533.gal : 4 ms
[2024-05-22 05:01:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11094101724511106659.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/ReachabilityCardinality16916473115032705533.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11094101724511106659.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 ...309
Loading property file /tmp/ReachabilityCardinality11094101724511106659.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :9 after 1593
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :1593 after 14535
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :14535 after 4.13672e+08
Invariant property DES-PT-40a-ReachabilityCardinality-2024-04 does not hold.
FORMULA DES-PT-40a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :4.13672e+08 after 7.2502e+08
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :7.2502e+08 after 9.11898e+08
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :9.11898e+08 after 1.28552e+09
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :1.28552e+09 after 1.97041e+09
Invariant property DES-PT-40a-ReachabilityCardinality-2024-14 does not hold.
FORMULA DES-PT-40a-ReachabilityCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :8.06816e+12 after 9.01148e+12
Invariant property DES-PT-40a-ReachabilityCardinality-2024-15 does not hold.
FORMULA DES-PT-40a-ReachabilityCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property DES-PT-40a-ReachabilityCardinality-2024-11 does not hold.
FORMULA DES-PT-40a-ReachabilityCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property DES-PT-40a-ReachabilityCardinality-2024-02 is true.
FORMULA DES-PT-40a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.6558e+13 after 1.75014e+13
Reachability property DES-PT-40a-ReachabilityCardinality-2024-12 is true.
FORMULA DES-PT-40a-ReachabilityCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property DES-PT-40a-ReachabilityCardinality-2024-10 is true.
FORMULA DES-PT-40a-ReachabilityCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property DES-PT-40a-ReachabilityCardinality-2024-08 does not hold.
FORMULA DES-PT-40a-ReachabilityCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
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.50479e+13,25.8535,197016,17178,3175,409174,18545,339,824526,385,106468,0
Total reachable state count : 25047904291177

Verifying 8 reachability properties.
Reachability property DES-PT-40a-ReachabilityCardinality-2024-02 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40a-ReachabilityCardinality-2024-02,2.22307e+06,25.8833,197016,155,386,409174,18545,342,824526,388,106468,0
Invariant property DES-PT-40a-ReachabilityCardinality-2024-04 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
DES-PT-40a-ReachabilityCardinality-2024-04,1.2079e+07,25.9074,197016,414,229,409174,18545,365,824526,400,106468,0
Invariant property DES-PT-40a-ReachabilityCardinality-2024-08 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
DES-PT-40a-ReachabilityCardinality-2024-08,741024,25.9246,197016,148,464,409174,18545,372,824526,404,106468,0
Reachability property DES-PT-40a-ReachabilityCardinality-2024-10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40a-ReachabilityCardinality-2024-10,2016,30.6786,197016,83,186,409174,18545,533,824526,449,106468,0
Invariant property DES-PT-40a-ReachabilityCardinality-2024-11 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
DES-PT-40a-ReachabilityCardinality-2024-11,1024,30.6817,197016,81,164,409174,18545,537,824526,452,106468,0
Reachability property DES-PT-40a-ReachabilityCardinality-2024-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40a-ReachabilityCardinality-2024-12,1.13821e+09,30.689,197016,166,517,409174,18545,544,824526,454,106468,0
Invariant property DES-PT-40a-ReachabilityCardinality-2024-14 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
DES-PT-40a-ReachabilityCardinality-2024-14,9.98485e+10,37.864,197016,17328,3035,409174,18545,687,824526,488,106468,0
Invariant property DES-PT-40a-ReachabilityCardinality-2024-15 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
DES-PT-40a-ReachabilityCardinality-2024-15,988032,37.8674,197016,164,434,409174,18545,693,824526,491,106468,0
All properties solved without resorting to model-checking.
Total runtime 222286 ms.

BK_STOP 1716354106683

--------------------
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="DES-PT-40a"
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 DES-PT-40a, 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 r092-tall-171624189900718"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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