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.r189-tall-171640618000493.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 HealthRecord-PT-12, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tall-171640618000493
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 20:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 12 20:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 20:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 71K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1716474621256

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-23 14:30:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-23 14:30:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:30:22] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-23 14:30:22] [INFO ] Transformed 160 places.
[2024-05-23 14:30:22] [INFO ] Transformed 340 transitions.
[2024-05-23 14:30:22] [INFO ] Found NUPN structural information;
[2024-05-23 14:30:22] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 180 ms.
Graph (trivial) has 274 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 4 ms
Free SCC test removed 4 places
Structural test allowed to assert that 31 places are NOT stable. Took 20 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
[2024-05-23 14:30:23] [INFO ] Flatten gal took : 130 ms
[2024-05-23 14:30:23] [INFO ] Flatten gal took : 40 ms
RANDOM walk for 40000 steps (3224 resets) in 1925 ms. (20 steps per ms) remains 55/129 properties
BEST_FIRST walk for 4003 steps (36 resets) in 62 ms. (63 steps per ms) remains 55/55 properties
[2024-05-23 14:30:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13926073041681327688.gal : 36 ms
BEST_FIRST walk for 4004 steps (34 resets) in 55 ms. (71 steps per ms) remains 55/55 properties
[2024-05-23 14:30:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10888327392789141938.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/ReachabilityCardinality13926073041681327688.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10888327392789141938.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4004 steps (35 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (37 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (38 resets) in 32 ms. (121 steps per ms) remains 55/55 properties

its-reach command run as :

BEST_FIRST walk for 4004 steps (36 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 4004 steps (37 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (34 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (35 resets) in 21 ms. (182 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (38 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
Loading property file /tmp/ReachabilityCardinality10888327392789141938.prop.
BEST_FIRST walk for 4004 steps (36 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (35 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (35 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (36 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
SDD proceeding with computation,55 properties remain. new max is 4
SDD size :1 after 3
BEST_FIRST walk for 4004 steps (31 resets) in 37 ms. (105 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
SDD proceeding with computation,55 properties remain. new max is 8
SDD size :3 after 4
BEST_FIRST walk for 4003 steps (36 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
SDD proceeding with computation,55 properties remain. new max is 16
SDD size :4 after 19
BEST_FIRST walk for 4003 steps (34 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
SDD proceeding with computation,55 properties remain. new max is 32
SDD size :19 after 487
BEST_FIRST walk for 4001 steps (33 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (33 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
SDD proceeding with computation,55 properties remain. new max is 64
SDD size :487 after 4375
BEST_FIRST walk for 4004 steps (35 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (35 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (35 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (34 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (38 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (38 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 21 ms. (182 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (39 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (35 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (38 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (34 resets) in 8 ms. (444 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (36 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (36 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (36 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (37 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (35 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (37 resets) in 31 ms. (125 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (36 resets) in 27 ms. (142 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (34 resets) in 12 ms. (308 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (34 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (37 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
SDD proceeding with computation,55 properties remain. new max is 128
SDD size :4375 after 11665
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (34 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (36 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (38 resets) in 9 ms. (400 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (37 resets) in 10 ms. (364 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (37 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (37 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (35 resets) in 9 ms. (400 steps per ms) remains 54/54 properties
[2024-05-23 14:30:23] [INFO ] Flow matrix only has 292 transitions (discarded 16 similar events)
// Phase 1: matrix 292 rows 156 cols
SDD proceeding with computation,55 properties remain. new max is 256
SDD size :11665 after 13123
[2024-05-23 14:30:23] [INFO ] Computed 18 invariants in 23 ms
[2024-05-23 14:30:23] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,55 properties remain. new max is 512
SDD size :13123 after 16039
SDD proceeding with computation,55 properties remain. new max is 1024
SDD size :16039 after 20413
SDD proceeding with computation,55 properties remain. new max is 2048
SDD size :20413 after 48601
SDD proceeding with computation,55 properties remain. new max is 4096
SDD size :48601 after 111205
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 43/97 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 43/107 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 59/156 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 59/174 constraints. Problems are: Problem set: 0 solved, 54 unsolved
SDD proceeding with computation,55 properties remain. new max is 8192
SDD size :111205 after 239815
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 291/447 variables, 156/330 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Invariant property smplace_51 does not hold.
Invariant property smplace_50 does not hold.
Invariant property smplace_40 does not hold.
Invariant property smplace_21 does not hold.
SDD proceeding with computation,51 properties remain. new max is 8192
SDD size :239815 after 968023
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/330 constraints. Problems are: Problem set: 3 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 1/448 variables, 1/331 constraints. Problems are: Problem set: 3 solved, 51 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 0/331 constraints. Problems are: Problem set: 3 solved, 51 unsolved
SDD proceeding with computation,51 properties remain. new max is 16384
SDD size :968023 after 1.68617e+06
At refinement iteration 12 (OVERLAPS) 0/448 variables, 0/331 constraints. Problems are: Problem set: 3 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 331 constraints, problems are : Problem set: 3 solved, 51 unsolved in 1886 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 156/156 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 3 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 3 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 43/94 variables, 10/61 constraints. Problems are: Problem set: 3 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 43/104 constraints. Problems are: Problem set: 3 solved, 51 unsolved
[2024-05-23 14:30:26] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 20 ms to minimize.
[2024-05-23 14:30:26] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 2 ms to minimize.
[2024-05-23 14:30:26] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:30:26] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:30:26] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-23 14:30:26] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:30:26] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:30:26] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-23 14:30:26] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:30:26] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-23 14:30:26] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
[2024-05-23 14:30:26] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:30:26] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 2 ms to minimize.
[2024-05-23 14:30:26] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-05-23 14:30:26] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:30:26] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
SDD proceeding with computation,51 properties remain. new max is 32768
SDD size :1.68617e+06 after 4.91444e+06
[2024-05-23 14:30:27] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 2 ms to minimize.
[2024-05-23 14:30:27] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 18/122 constraints. Problems are: Problem set: 3 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/122 constraints. Problems are: Problem set: 3 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 62/156 variables, 8/130 constraints. Problems are: Problem set: 3 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 62/192 constraints. Problems are: Problem set: 3 solved, 51 unsolved
[2024-05-23 14:30:27] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2024-05-23 14:30:27] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-23 14:30:27] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-23 14:30:27] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-05-23 14:30:27] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2024-05-23 14:30:27] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-05-23 14:30:27] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:30:27] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:30:27] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-23 14:30:27] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:30:27] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:30:28] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-23 14:30:28] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:30:28] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-05-23 14:30:28] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 2 ms to minimize.
[2024-05-23 14:30:28] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-23 14:30:28] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 7 ms to minimize.
[2024-05-23 14:30:28] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:30:28] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:30:28] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 20/212 constraints. Problems are: Problem set: 3 solved, 51 unsolved
[2024-05-23 14:30:28] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-05-23 14:30:28] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-23 14:30:28] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:30:28] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-23 14:30:28] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-23 14:30:28] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:30:28] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:30:28] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:30:28] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:30:28] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 0 ms to minimize.
[2024-05-23 14:30:29] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:30:29] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-23 14:30:29] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 2 ms to minimize.
[2024-05-23 14:30:29] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:30:29] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2024-05-23 14:30:29] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
Invariant property smplace_143 does not hold.
Invariant property smplace_136 does not hold.
Invariant property smplace_132 does not hold.
Invariant property smplace_128 does not hold.
Invariant property smplace_124 does not hold.
[2024-05-23 14:30:29] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
Invariant property smplace_122 does not hold.
[2024-05-23 14:30:29] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
Invariant property smplace_52 does not hold.
Invariant property smplace_47 does not hold.
Invariant property smplace_46 does not hold.
Invariant property smplace_45 does not hold.
Invariant property smplace_44 does not hold.
Invariant property smplace_43 does not hold.
[2024-05-23 14:30:29] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 9 ms to minimize.
Invariant property smplace_33 does not hold.
Invariant property smplace_28 does not hold.
Invariant property smplace_27 does not hold.
Invariant property smplace_26 does not hold.
Invariant property smplace_25 does not hold.
Invariant property smplace_24 does not hold.
[2024-05-23 14:30:29] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
Invariant property smplace_14 does not hold.
Invariant property smplace_9 does not hold.
Invariant property smplace_8 does not hold.
Invariant property smplace_7 does not hold.
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 20/232 constraints. Problems are: Problem set: 25 solved, 29 unsolved
Invariant property smplace_6 does not hold.
Invariant property smplace_5 does not hold.
SDD proceeding with computation,27 properties remain. new max is 32768
SDD size :4.91444e+06 after 2.33382e+07
[2024-05-23 14:30:29] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-23 14:30:29] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 2/234 constraints. Problems are: Problem set: 27 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 0/234 constraints. Problems are: Problem set: 27 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 291/447 variables, 156/390 constraints. Problems are: Problem set: 27 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 27/417 constraints. Problems are: Problem set: 27 solved, 27 unsolved
[2024-05-23 14:30:30] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 1/418 constraints. Problems are: Problem set: 27 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/447 variables, 0/418 constraints. Problems are: Problem set: 27 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 1/448 variables, 1/419 constraints. Problems are: Problem set: 27 solved, 27 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/448 variables, and 419 constraints, problems are : Problem set: 27 solved, 27 unsolved in 5011 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 156/156 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/54 constraints, Known Traps: 61/61 constraints]
After SMT, in 7013ms problems are : Problem set: 27 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 308/308 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 156 transition count 290
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 155 transition count 289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 155 transition count 288
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 154 transition count 288
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 95 place count 81 transition count 142
Iterating global reduction 2 with 73 rules applied. Total rules applied 168 place count 81 transition count 142
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 76 transition count 132
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 76 transition count 132
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 187 place count 76 transition count 123
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 195 place count 72 transition count 151
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 198 place count 72 transition count 148
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 204 place count 72 transition count 142
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 210 place count 66 transition count 142
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 211 place count 66 transition count 142
Applied a total of 211 rules in 52 ms. Remains 66 /156 variables (removed 90) and now considering 142/308 (removed 166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 66/156 places, 142/308 transitions.
SDD proceeding with computation,27 properties remain. new max is 65536
SDD size :2.33382e+07 after 3.02357e+07
RANDOM walk for 4000000 steps (726245 resets) in 19344 ms. (206 steps per ms) remains 9/27 properties
BEST_FIRST walk for 4000003 steps (112266 resets) in 4214 ms. (948 steps per ms) remains 9/9 properties
Invariant property smplace_148 does not hold.
Invariant property smplace_147 does not hold.
Invariant property smplace_89 does not hold.
Invariant property smplace_82 does not hold.
Invariant property smplace_75 does not hold.
Invariant property smplace_68 does not hold.
Invariant property smplace_61 does not hold.
Invariant property smplace_57 does not hold.
Invariant property smplace_39 does not hold.
Invariant property smplace_20 does not hold.
Invariant property smplace_1 does not hold.
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :3.02357e+07 after 9.46428e+07
BEST_FIRST walk for 4000004 steps (112330 resets) in 3496 ms. (1143 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (112179 resets) in 3570 ms. (1120 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (112144 resets) in 3145 ms. (1271 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (112178 resets) in 3321 ms. (1204 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (112016 resets) in 3844 ms. (1040 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000002 steps (112106 resets) in 4081 ms. (979 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (112104 resets) in 3560 ms. (1123 steps per ms) remains 7/9 properties
Invariant property smplace_121 does not hold.
Invariant property smplace_93 does not hold.
SDD proceeding with computation,14 properties remain. new max is 65536
SDD size :9.46428e+07 after 2.14627e+08
BEST_FIRST walk for 4000004 steps (112436 resets) in 3143 ms. (1272 steps per ms) remains 7/7 properties
[2024-05-23 14:30:49] [INFO ] Flow matrix only has 122 transitions (discarded 20 similar events)
// Phase 1: matrix 122 rows 66 cols
[2024-05-23 14:30:49] [INFO ] Computed 18 invariants in 1 ms
[2024-05-23 14:30:49] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 47/52 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 14/66 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 122/188 variables, 66/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 21/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/188 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 105 constraints, problems are : Problem set: 0 solved, 5 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 66/66 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 47/52 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 14:30:49] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:30:49] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2024-05-23 14:30:49] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-23 14:30:49] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-23 14:30:49] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-23 14:30:49] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-23 14:30:49] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 14/66 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 14:30:49] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 122/188 variables, 66/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 21/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/188 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 118 constraints, problems are : Problem set: 0 solved, 5 unsolved in 479 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 66/66 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints]
After SMT, in 588ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 122 ms.
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 142/142 transitions.
Graph (complete) has 349 edges and 66 vertex of which 56 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 56 transition count 138
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 52 transition count 137
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 15 place count 47 transition count 127
Iterating global reduction 2 with 5 rules applied. Total rules applied 20 place count 47 transition count 127
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 45 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 45 transition count 123
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 44 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 44 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 43 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 43 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 32 place count 43 transition count 113
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 3 with 2 rules applied. Total rules applied 34 place count 42 transition count 112
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 42 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 36 place count 41 transition count 111
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 53 place count 41 transition count 111
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 69 place count 41 transition count 111
Applied a total of 69 rules in 31 ms. Remains 41 /66 variables (removed 25) and now considering 111/142 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 41/66 places, 111/142 transitions.
RANDOM walk for 662294 steps (49302 resets) in 2219 ms. (298 steps per ms) remains 0/5 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 131 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS TRIVIAL_UNMARKED_SCC_TEST COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL
Total runtime 28593 ms.

BK_STOP 1716474651032

--------------------
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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="HealthRecord-PT-12"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 HealthRecord-PT-12, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r189-tall-171640618000493"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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